Zobrazeno 1 - 10
of 112
pro vyhledávání: '"Warren Abstract Machine"'
Autor:
David S. Warren
Publikováno v:
Declarative Logic Programming
This chapter is a tutorial presentation of the Warren Abstract Machine (akaWAM), which is a virtual machine for Prolog designed by David H. D.Warren [Warren 1983] (note not David S. Warren, who is the author of this chapter.) We present a variant of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::41a5db7a484f1ee1e96546a5c3228ca5
https://doi.org/10.1145/3191315.3191320
https://doi.org/10.1145/3191315.3191320
Autor:
Karl Crary, Brandon Bohrer
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030035914
VSTTE
VSTTE
Type-preserving (or typed) compilation uses typing derivations to certify correctness properties of compilation. We have designed and implemented a typed compiler for an idealized logic programming language we call T-Prolog. The crux of our approach
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::22cc8c47eddf321fe38790d6e8dd5149
https://doi.org/10.1007/978-3-030-03592-1_7
https://doi.org/10.1007/978-3-030-03592-1_7
Autor:
Haljuk, Petr
This Master's deals with the implementation of the interpreter of logic programming language "Prolog". It summarises the different approaches to evaluation of programs in thislanguage with focus on description of The Warren Abstract Machine. A new wa
Externí odkaz:
http://www.nusl.cz/ntk/nusl-363907
Autor:
Edmund Weitz
Publikováno v:
Common Lisp Recipes ISBN: 9781484211779
Once upon a time, Lisp ruled the world…Well, OK, not really. But there used to be a time when you could buy horribly expensive but impressive computers called Lisp Machines where the whole operating system was written in Lisp and Lisp was the domin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2059594f2b6f56d530cb00b507bab700
https://doi.org/10.1007/978-1-4842-1176-2_19
https://doi.org/10.1007/978-1-4842-1176-2_19
Autor:
Neng-Fa Zhou
Publikováno v:
Theory and Practice of Logic Programming. 12:189-218
B-Prolog is a high-performance implementation of the standard Prolog language with several extensions including matching clauses, action rules for event handling, finite-domain constraint solving, arrays and hash tables, declarative loop constructs,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f2a046048691e83c1b8c2dbe540cbb32
https://doi.org/10.1017/s1471068411000445
https://doi.org/10.1017/s1471068411000445
Autor:
Honorato, Mauro Jacob
Publikováno v:
Repositório Institucional da UFUUniversidade Federal de UberlândiaUFU.
Esse trabalho propõe a implementação de um sistema Prolog eficiente no espaço, o mesmo é baseado nos trabalhos de David H. D. Warren e Hassan Aït-Kaci. A Common Lisp é a estrutura usada para a construção do sistema Prolog, ela foi escolhida
Externí odkaz:
https://repositorio.ufu.br/handle/123456789/17800
Autor:
Mauro Jacob Honorato
Publikováno v:
Repositório Institucional da UFU
Universidade Federal de Uberlândia (UFU)
instacron:UFU
Universidade Federal de Uberlândia (UFU)
instacron:UFU
Esse trabalho propõe a implementação de um sistema Prolog eficiente no espaço, o mesmo é baseado nos trabalhos de David H. D. Warren e Hassan Aït-Kaci. A Common Lisp é a estrutura usada para a construção do sistema Prolog, ela foi escolhida
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9bbfdd6f2642103b571a3f4659ba58f4
https://repositorio.ufu.br/handle/123456789/17800
https://repositorio.ufu.br/handle/123456789/17800
Autor:
Rocha, Junia Magalhães
Publikováno v:
Repositório Institucional da UFU
Universidade Federal de Uberlândia (UFU)
instacron:UFU
Universidade Federal de Uberlândia (UFU)
instacron:UFU
X This thesis proposes the implementation of a theorem prover using a functional programing language. The implementation was based on the Warren Abstract Machine (WAM). The objective behind implementing the WAM is to achieve robustness and while runn
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3056::ce9333275d3f192e61905d1049282b19
https://repositorio.ufu.br/handle/123456789/20991
https://repositorio.ufu.br/handle/123456789/20991
Autor:
Harold Boley
Publikováno v:
Theoretical Computer Science. 212(1-2):77-99
RELFUN reciprocally extends Horn RELations and call-by-value FUNctions just enough to yield a unified operator concept. Relations acquire application nesting and higher-order notation; functions acquire non-groundness and non-determinism. Relations a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::245dd154eedb65e0601c7bfea1a16da8
Autor:
Ilyas Cicekli
Publikováno v:
Journal of Logic Programming
A compiler-based meta-level system for MetaProlog language is presented. Since MetaProlog is a meta-level extension of Prolog, the Warren Abstract Machine (WAM) is extended to get an efficient implementation of meta-level facilities; this extension i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a8bccd8e81a2c389c92e797356660a56
https://doi.org/10.1016/s0743-1066(97)00075-7
https://doi.org/10.1016/s0743-1066(97)00075-7