Specifying Prolog trace models with a continuation semantics

DOI10.1007/3-540-45142-0_10MaRDI QIDQ4421877zbMATH OpenFDO

Authors Erwan Jahier, Mireille Ducassé, Olivier Ridoux

Publication date 1 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2042/20420165.htm

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 1737610
• Logic Programming
• Trace semantics via determinization
• Trace semantics via determinization
• Deriving proof rules from continuation semantics
• Dynamic logic with trace semantics
• Coalgebraic trace semantics for continuous probabilistic transition systems
• Proving termination properties of prolog programs: A semantic approach
• Reasoning about prolog programs: From modes through types to assertions
• scientific article; zbMATH DE number 823595

Cited in

(5)

• Compositional operational semantics for Prolog programs
• A trace query language for rule-based models
• The BinProlog experience: architecture and implementation choices for continuation passing Prolog and first-class logic engines
• scientific article; zbMATH DE number 1497842 (Why is no real title available?)
• Debugging for Model Expansion

This page was built for publication: Specifying Prolog trace models with a continuation semantics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4421877)