Sciweavers

850 search results - page 66 / 170
» A Logic Programming Language Based on Binding Algebras
Sort
View
AGP
1997
IEEE
15 years 5 months ago
Safe Folding/Unfolding with Conditional Narrowing
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
María Alpuente, Moreno Falaschi, Giné...
LICS
1992
IEEE
15 years 5 months ago
Compiler Verification in LF
We sketch a methodology for the verification of compiler correctness based on the LF Logical Framework as realized within the Elf programming language. We have applied this techni...
John Hannan, Frank Pfenning
PPDP
2004
Springer
15 years 6 months ago
Nominal rewriting systems
We present a generalisation of first-order rewriting which allows us to deal with terms involving binding operations in an elegant and practical way. We use a nominal approach to...
Maribel Fernández, Murdoch Gabbay, Ian Mack...
RR
2010
Springer
14 years 11 months ago
Analyzing the AIR Language: A Semantic Web (Production) Rule Language
The Accountability In RDF (AIR) language is an N3-based, Semantic Web production rule language that supports nested activation of rules, negation, closed world reasoning, scoped co...
Ankesh Khandelwal, Jie Bao, Lalana Kagal, Ian Jaco...
DAGSTUHL
2003
15 years 2 months ago
Embedding a Hardware Description Language in Template Haskell
Abstract. Hydra is a domain-specific language for designing digital circuits, which is implemented by embedding within Haskell. Many features required for hardware specification ...
John T. O'Donnell