On the algebraic structure of declarative programming languages
From MaRDI portal
Publication:1035699
DOI10.1016/j.tcs.2009.07.038zbMath1187.68121OpenAlexW1964964089MaRDI QIDQ1035699
James Lipton, Robert McGrail, Gianluca Amato
Publication date: 4 November 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.07.038
Related Items
Exploiting parallelism in coalgebraic logic programming ⋮ Declarative Compilation for Constraint Logic Programming ⋮ Constraint logic programming with a relational machine ⋮ Kripke semantics for higher-order type theory applied to constraint logic programming languages ⋮ Logic programming: laxness and saturation ⋮ Optimal multibinding unification for sharing and linearity analysis ⋮ Category Theoretic Semantics for Theorem Proving in Logic Programming: Embracing the Laxness ⋮ Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Forum: A multiple-conclusion specification logic
- An alternative linear semantics for allowed logic programs
- On the unity of logic
- ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
- Functorial polymorphism
- Notions of computation and monads
- Category theory and computer programming. Tutorial and Workshop, Guildford, U.K., September 16-20, 1985. Proceedings
- Semantics of infinite tree logic programming
- An algebraic semantics for structured transition systems and its application to logic programs
- First order categorical logic. Model-theoretical methods in the theory of topoi and related categories
- Categorical logic and type theory
- A proof procedure for the logic of hereditary Harrop formulas
- Logic programming in a fragment of intuitionistic linear logic
- A new framework for declarative programming
- A theory of observables for logic programs
- Uniform proofs as a foundation for logic programming
- Indexed Categories and Bottom-Up Semantics of Logic Programs
- Higher-order Horn clauses
- HYPERDOCTRINES, NATURAL DEDUCTION AND THE BECK CONDITION
- Data Type Specification: Parameterization and the Power of Specification Techniques
- A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
- HiLog: A foundation for higher-order logic programming
- The Semantics of Predicate Logic as a Programming Language
- Adjointness in Foundations
- A modal extension of logic programming: modularity, beliefs and hypothetical reasoning
- Hidden coinduction: behavioural correctness proofs for objects
- A Uniform Proof-theoretic Investigation of Linear Logic Programming
- Institutions: abstract model theory for specification and programming
- The integration of functions into logic programming: From theory to practice
- Premonoidal categories and notions of computation
- Constraint Logic Programming with Hereditary Harrop formulas
- Algebraic implementation of abstract data types: a survey of concepts and new compositionality results
- Logic Programming
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
