Logic Programming

DOI10.1007/B99475MaRDI QIDQ5313189zbMATH OpenOpenAlexFDO

Authors James Cheney, Christian Urban

Publication date 26 August 2005

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

Full work available at URL https://doi.org/10.1007/b99475

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 2242590
• Typed Lambda Calculi and Applications
• The Semantics of Nominal Logic Programs
• scientific article; zbMATH DE number 1692888
• Nominal logic, a first order theory of names and binding

Cited in

(31)

• A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets
• On the algebraic structure of declarative programming languages
• Nominal equational problems
• Mechanized metatheory revisited
• Encoding abstract syntax without fresh names
• Nominal syntax with atom substitutions
• scientific article; zbMATH DE number 1692888 (Why is no real title available?)
• Executable relational specifications of polymorphic type systems using Prolog
• A theory of name resolution
• Romeo: a system for more flexible binding-safe programming
• Nominal equational logic
• Implementing nominal unification
• Contextual equivalence for inductive definitions with binders in higher order typed functional programming
• Declarative compilation for constraint logic programming
• Generative unbinding of names
• Validating Brouwer's continuity principle for numbers using named exceptions
• Two-level lambda-calculus
• A certified functional nominal C-unification algorithm
• Constraint logic programming with a relational machine
• Romeo: a system for more flexible binding-safe programming
• α lean TA P: A Declarative Theorem Prover for First-Order Classical Logic
• Typed Lambda Calculi and Applications
• A Survey of the Proof-Theoretic Foundations of Logic Programming
• Equivariant unification
• Strong nominal semantics for fixed-point constraints
• Equational reasoning modulo commutativity in languages with binders
• A nominal approach to equational problems in languages with binders
• Nominal Henkin semantics: simply-typed lambda-calculus models in nominal sets
• Certified first-order AC-unification and applications.
• PNL to HOL: from the logic of nominal sets to the logic of higher-order functions
• Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms

Describes a project that uses

Uses Software

• FreshML

This page was built for publication: Logic Programming

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