Sciweavers

24 search results - page 4 / 5
» Fixpoint semantics for logic programming a survey
Sort
View
ICFP
2002
ACM
14 years 7 months ago
A compiled implementation of strong reduction
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
Benjamin Grégoire, Xavier Leroy
FAC
2007
170views more  FAC 2007»
13 years 7 months ago
Are the Logical Foundations of Verifying Compiler Prototypes Matching user Expectations?
Abstract. The Verifying Compiler (VC) project proposals suggest that mainstream software developers are its targeted end-users. Like other software engineering efforts, the VC proj...
Patrice Chalin
ICLP
2004
Springer
14 years 26 days ago
MProlog: An Extension of Prolog for Modal Logic Programming
We introduce our implemented modal logic programming system MProlog. This system is written in Prolog as a module for Prolog. Codes, libraries, and most features of Prolog can be u...
Linh Anh Nguyen
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 4 months ago
XSB: Extending Prolog with Tabled Logic Programming
The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this ar...
Terrance Swift, David Scott Warren
RULEML
2005
Springer
14 years 29 days ago
A Realistic Architecture for the Semantic Web
In this paper we argue that a realistic architecture for the Semantic Web must be based on multiple independent, but interoperable, stacks of languages. In particular, we argue tha...
Michael Kifer, Jos de Bruijn, Harold Boley, Dieter...