A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
A sequential abstract machine for flat concurrent prolog
1989
The Journal of Logic Programming
Preserved Fulltext
SEQUENTIAL ABSTRACT MACHINE FOR FCP SEQUENTIAL ABSTRACT MACHINE FOR FCP ABSTRACT MACHINE FOR FCP ABSTRACT MACHINE FOR FCP 105 ABSTRACT MACHINE FOR FCP ABSTRACT MACHINE FOR FCP APPENDIX 2. ...
SEQUENTIAL ABSTRACT MACHINE FOR FCP 87 An FCP term is either a variable or a structure. ...
The design of the abstract machine and the implementation of its emulator were part of a group project, and ideas of many are incorporated in this work. ...
doi:10.1016/0743-1066(89)90011-3
fatcat:gtdydjcuu5ckjaiw3ptgxeh72i
KWIC (key word in context)
1984
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Model to Efficient Compilation of Patterns [166]From Abstract PROLOG Instruction Set [672]An Abstract PROLOG Machine-a Specification [383] Abstract PROLOG Machine and its Application to Partial Evaluation ...
[336] on of an Abstract PROLOG Machine [334]An Abstraction in Logic Programming [198]Modularization and Abstraction in Logic Programming [199]Modularization and Abstraction in PROLOG/KR [439]Data Acceptability ...
of its Architecture and
Hardware System [629]_nce
Machine (SIM-P or PSI) [630]The Personal Sequential
Inference
Machine-a Specification [383]Abstract PROLOG
Machine and Data Base Machine as the Basic ...
doi:10.1016/0743-1066(84)90025-6
fatcat:ypq2jrr3mvd3hflnp6ftrcd5vm
OR-parallel PROLOG in flat concurrent PROLOG
1989
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The algorithm can be implemented directly in Flat Concurrent PROLOG. ...
D We describe a simple OR-parallel execution algorithm for PROLOG that naturally collects all solutions to a goal. ...
Indeed, the main focus of our research turned into Flat Concurrent PROLOG, a subset of Concurrent PROLOG with simple guards, and we were left with the original problem: How to embed PROLOG in a machine ...
doi:10.1016/0743-1066(89)90016-2
fatcat:ee6xvsrjkfc3bnj7q72hdcfi4e
A distributed, net oriented semantics for Delta Prolog
[chapter]
1989
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
A truly distributed operational semantics for Concurrent Logic Languages is defined here, differently from those semantics based on intrinsically sequential, interleaving models defined so far. ...
A scheme for translating a Delta Prolog system into a 1-safe Petri net is given and properties of (perpetual)processes based on the notion of causality, e.g. fairness and deadlock, are addressed. 163 Concurrent ...
Acknowledgments We would like to thank Pierpaolo Degano for many valuable discussions and suggestions. ...
doi:10.1007/3-540-50939-9_131
fatcat:js4ixrhqgbe5fojd2jq3ok7m5u
Linear logic semantics for Concurrent Prolog
[chapter]
1994
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This paper develops a proof-theoretic semantics based on linear logic for Concurrent Prolog. ...
It is demonstrated that the relationship between a logic programming language, such as Prolog, and a committed-choice concurrent logic one, such as Concurrent Prolog, can be understood as a change of the ...
simple proof-theoretic definition of a partial-order semantics for concurrent logic programs based on a variant of Flat Concurrent Prolog. ...
doi:10.1007/3-540-58025-5_66
fatcat:fgrkokatfnduneiit5utujalia
Tackling Complexity in High Performance Computing Applications
2016
International journal of parallel programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A constraint solver, written in Prolog, guides a user in making valid choices of parameters, implementations, machines etc. for any given context. ...
A repository provides alternative implementations for these abstract components. ...
In the current prototype the Prolog database is flat. ...
doi:10.1007/s10766-016-0422-9
pmid:32226222
pmcid:PMC7089654
fatcat:owxtkvg35bby5d52n24o6f5l7e
The abstract state machines method for modular design and analysis of programming languages
2014
Journal of Logic and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We survey the use of Abstract State Machines in the area of programming languages, namely to define behavioral properties of programs at source, intermediate and machine levels in a way that is amenable ...
models, leading from the source code to a machine code view for full-fledged real-life programming languages. ...
programming language Gödel: a ground model ASM could be defined by abstracting in the Prolog ground model ASM from the deterministic and sequential execution strategy of ISO Prolog [48] , a ground model ...
doi:10.1093/logcom/exu077
fatcat:7quppauog5eyvaahlbvlrk7w3u
Logic programming in the context of multiparadigm programming: the Oz experience
[article]
2002
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
A multiparadigm language is designed to support different programming paradigms (logic, functional, constraint, object-oriented, sequential, concurrent, etc.) with equal ease. ...
This model subsumes both concurrent logic programming (committed-choice-style) and search-based logic programming (Prolog-style). ...
An overview of the parallel language Id -a foundation for pH, a parallel dialect of Haskell. Tech. rept. Digital Equipment Corporation, Cambridge Research Laboratory. ...
arXiv:cs/0208029v1
fatcat:aef4drwtkfd4tcyknziqfegbja
Pressing for parallelism: a PROLOG program made Concurrent
1986
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
D We describe the translation of a nontrivial program for solving equations from PROLOG to Concurrent PROLOG, and further to Flat Concurrent PROLOG. ...
The translation from Concurrent PROLOG to Flat Concurrent PROLOG was more suitable to be the basis for automatic procedures. ...
doi:10.1016/0743-1066(86)90006-3
fatcat:tx7oqq7vwne3jipx34msm66nay
Logic programming in the context of multiparadigm programming: the Oz experience
2003
Theory and Practice of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
A multiparadigm language is designed to support different programming paradigms (logic, functional, constraint, object-oriented, sequential, concurrent, etc.) with equal ease. ...
This model subsumes both concurrent logic programming (committed-choice-style) and search-based logic programming (Prolog-style). ...
We thank the anonymous referees for their comments that helped us much improve the presentation. Finally, we give a special thanks to Juris Reinfelds. ...
doi:10.1017/s1471068403001741
fatcat:opfvkb5i3vellfgk7s3mozjo7i
A Pure Meta-interpreter for Flat GHC, a Concurrent Constraint Language
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Our objective, in contrast, is to design the pair of (i) a representation of programs suitable for code mobility and (ii) a pure interpreter (or virtual machine) of the represented code, bearing networked ...
This paper discusses the construction of a meta-interpreter of Flat GHC, one of the simplest and earliest concurrent constraint languages. ...
Indeed, concurrent constraint programming with ask and eventual tell can be thought of as an abstract model of Flat GHC. ...
doi:10.1007/3-540-45628-7_7
fatcat:l6catykusrdt3k6uxhac46uhpa
The Family of Concurrent Logic Programming Languages
[chapter]
1991
Logic, Algebra, and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
CORE CONCEPTS AND TECHNIQUES
Concurrent Logic Programming Transformational vs. reactive languages Prolog is a sequential progtamming language, designed to run efficiently on a Von Neumann machine by ...
Prolog Prolog is a concrete programming language based on the abstract logic programming model. ...
doi:10.1007/978-3-642-76799-9_10
fatcat:rjyl5efexfgdnirsslmzgsgl3u
The family of concurrent logic programming languages
1989
ACM Computing Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
CORE CONCEPTS AND TECHNIQUES
Concurrent Logic Programming Transformational vs. reactive languages Prolog is a sequential progtamming language, designed to run efficiently on a Von Neumann machine by ...
Prolog Prolog is a concrete programming language based on the abstract logic programming model. ...
doi:10.1145/72551.72555
fatcat:ywvqbl5bkve3jlv37ffkynwksa
A history of the Oz multiparadigm language
2020
Proceedings of the ACM on Programming Languages (PACMPL)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The first Prolog compiler was built by David H.D. Warren in 1977 [Warren 1977 . By 1983, Warren had developed the New Prolog Engine, which was soon called the WAM (Warren Abstract Machine) ]. ...
The flat versions of Concurrent Prolog and GHC, called FCP and FGHC respectively, were developed into large systems [Institute for New Generation Computer Technology 1992; Shapiro 1989 ]. ...
Seen from the outside, ForCollect is a functional abstraction. ...
doi:10.1145/3386333
fatcat:sznttm7q3nhedfm5hcue7x76di
A π-calculus specification of prolog
[chapter]
1994
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A smooth merging of the specification for control and the specification for unification gives a full specification for much of Prolog. Some related and further works are also discussed. ...
A clear and modular specification of Prolog using the ~rcalculus is presented in this paper. ...
I also thank Srinivas Bangalore for helpful discussions. This project has been funded in part by NSF grants CCR-91-02753 and CCR-92-09224. ...
doi:10.1007/3-540-57880-3_25
fatcat:jysqok3xerblta7kgdo3vcydfq
« Previous
Showing results 1 — 15 out of 365 results