The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Filters
Page 1145 of Mathematical Reviews Vol. , Issue 98B
[page]
1998
Mathematical Reviews
Preserved Fulltext
Thus, surprisingly, semantic unification can be used for giving termination proofs for logic programs. Parts of the technique can be automated very eas- ily. ...
Summary: “In this paper, which is a brief version of a forthcoming paper, we discuss how one can extend logic programming to any set of clauses.” ...
Page 3606 of Mathematical Reviews Vol. , Issue 2000e
[page]
2000
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
For the web version of Mathematical Reviews, see http: //www.ams. org/mathscinet ...
Semantics of general logic programs. (English summary)
J. Logic Programming 35 (1998), no. 2, 171-194.
Summary: “We suggested in Part I [A. Bochman, J. ...
Preface to special issue: LSFA 2017 and 2018
2021
Mathematical Structures 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 2022; you can also visit the original URL.
The file type is application/pdf.
Nine manuscripts were submitted, of which four were selected for inclusion in the issue. ...
Out of the total of 29 papers that were presented at LSFA 2017 and 2018, 15 were invited to submit an extended version to this special issue. ...
We thank all the anonymous referees for their thorough and careful reviews and all the members of MSCS involved in processing this issue. ...
doi:10.1017/s096012952100044x
fatcat:yfcs2dzfubexvni637ihwlynlm
Language composition untangled
2012
Proceedings of the Twelfth Workshop on Language Descriptions, Tools, and Applications - LDTA '12
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.
In language-oriented programming and modeling, software developers are largely concerned with the definition of domainspecific languages (DSLs) and their composition. ...
To clarify the issue, we specify five forms of language composition: language extension, language restriction, language unification, self-extension, and extension composition. ...
Our separation of languages into four components is general and covers any programming language. ...
doi:10.1145/2427048.2427055
dblp:conf/ldta/ErdwegGR12
fatcat:5dnmg4mb3vfxxbczce6hqtyb64
Editorial
2017
Formal Aspects of Computing
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.
The author shows a new iterated fixpoint characterization of the well-founded semantics and Answer Set Programming by using dual programs. ...
This special issue includes a selection of papers that are extended and revised versions of the ones presented at the 25th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR ...
The authors distinguish four different kinds of resolution: resolution by unification (SLD-resolution), resolution by term-matching, the recently introduced structural resolution, and partial (or lazy) ...
doi:10.1007/s00165-017-0427-1
fatcat:ej4i24vlenal5nqud65wus76ma
Development of Correct Transformation Schemata for Prolog Programs
[chapter]
1998
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 2017; you can also visit the original URL.
The file type is application/pdf.
We consider a transformation schema to be correct if its application yields a target program which is equivalent to the source program under the pure Prolog semantics. ...
operations on schemata, and a higher-order unification algorithm which forms the basis of the schema transformation operations. ...
We have implemented the higher-order unification algorithm, and a simplified version of some of the transformations. ...
doi:10.1007/3-540-49674-2_14
fatcat:afq7466bsrdebiz6j3sqnbnfvm
Control flow versus logic: A denotational and a declarative model for Guarded Horn Clauses
[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.
The paper gives four semantic models for Guarded Horn Clauses (GHQ. ...
Terms and atoms are defined as usual, except for that the set of atoms is extended with so-called unification atoms. An unification atom is of the form t 1 = t 2, where t1 and t2 are terms. ...
Acknowledgement: We are grateful to the members of the Amsterdam Concurrency Group; while discussing a preliminary version of this paper, they detected a serious error. ...
doi:10.1007/3-540-51486-4_64
fatcat:5svcy3vy4vfunfzxflavosdo3m
Page 5957 of Mathematical Reviews Vol. , Issue 90J
[page]
1990
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Franchi-Zannettacci, Unification-free execution of TYPOL programs by semantic attributive evaluation (pp. 160-177); David B. Kemp and Rodney W. ...
Miller], Uses of higher-order unification for im- plementing program transformers (pp. 942-959); Aida Batarekh and V. S. ...
Page 1390 of Linguistics and Language Behavior Abstracts: LLBA Vol. 27, Issue 3
[page]
1993
Linguistics and Language Behavior Abstracts: LLBA
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
for semantics, & (5) computers as real- izations of computer programs are syntactic rather than semantic ma- chines. ...
A simplified Prolog version of this parser is included. 1 Appendix, 13 References. Adapted from the source document. ...
The performance of parallel Prolog programs
1990
IEEE transactions on computers
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 2007; you can also visit the original URL.
The file type is application/pdf.
for the benchmarks examined if the semantics of Prolog were preserved. ...
The results show that restricted ANo-parallelism is of limited benefit for small programs, but produced speedups from 7 to 10 on two large programs. on-parallelism was generally not found to be useful ...
In an attempt to measure the degree of performance inhibition caused by the semantics of sequential Prolog, four single-solution benchmarks were recompiled with a relaxed version of solution ordering. ...
doi:10.1109/12.61072
fatcat:rdeiqbw3pvcqhnkks2bzhm4fau
Page 1423 of Mathematical Reviews Vol. , Issue 2000b
[page]
2000
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Neculai Curteanu (R-IASI-SM; Iasi)
For the web version of Mathematical Reviews, see http: //www.ams.org/mathscinet ...
We present proof calculi and a model theory for this logic, and we prove the existence of free term models which provide an ade- quate intended semantics for programs. ...
MleanCoP: A Connection Prover for First-Order Modal Logic
[chapter]
2014
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 2015; you can also visit the original URL.
The file type is application/pdf.
The proof search is based on a prefixed connection calculus and an additional prefix unification, which captures the Kripke semantics of different modal logics. ...
The most recent version also supports heterogeneous multimodal logics and outputs a compact prefixed connection proof. An experimental evaluation shows the strong performance of MleanCoP. ...
version 1.1 of the QMLTP library [14] . ...
doi:10.1007/978-3-319-08587-6_20
fatcat:725b2a3rnne5jc6qxsedfoocga
Logimix: A Self-Applicable Partial Evaluator for Prolog
[chapter]
1993
Logic Program Synthesis and Transformation
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 2015; you can also visit the original URL.
The file type is application/pdf.
Great care is taken to preserve the operational semantics of the partially evaluated programs, including the effects of non-logical predicates and side effects. ...
Nevertheless, we implement unification in the partial evaluator by unification in the underlying Prolog system. This significantly improves upon [4] which use explicitly coded meta-unification. ...
The predicate accepts occurs in four different specialized versions, accepts_0 . . . accepts_3. ...
doi:10.1007/978-1-4471-3560-9_15
dblp:conf/lopstr/MogensenB92
fatcat:vr3slzmydjakhgvlk7cnbudc4q
Certified Semantics for Relational Programming
[article]
2020
arXiv
pre-print
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.
Other Versions
We present a formal study of semantics for the relational programming language miniKanren. ...
First, we formulate a denotational semantics which corresponds to the minimal Herbrand model for definite logic programs. ...
The first two rules specify the semantics of unification. ...
arXiv:2005.01018v2
fatcat:4y4bhiy3l5ce7klur3iuvdjove
Language composition using source code annotations
2016
Computer Science and Information Systems
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.
In this paper we examine source code annotations from the viewpoint of formal languages -we discuss their abstract syntax, concrete syntax, and semantics, thus showing the correspondence between annotations ...
We then show how pure embedding with annotations can be used for language unification, language referencing by extension, and language extension. ...
This work was supported by project KEGA No. 019TUKE-4/2014 Integration of the Basic Theories of Software Engineering into Courses for Informatics Master Study Programmes at Technical Universities -Proposal ...
doi:10.2298/csis160114024n
fatcat:7c3ymavbtre5vpu3xzglcl2aty
« Previous
Showing results 1 — 15 out of 10,495 results