Functional logic languages, Part I
Proc. of a workshop on Graph reduction
A fully abstract semantics for a functional language with logic variables
Proceedings of the Fourth Annual Symposium on Logic in computer science
The semantic foundations of concurrent constraint programming
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Notions of computation and monads
Information and Computation
Logic programming with functions and predicates: the language Babel
Journal of Logic Programming
Notions of Computation Determine Monads
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Axiomatization of a Functional Logic Language
Proceedings of the Second International Conference on Algebraic and Logic Programming
A Fibrational Semantics for Logic Programs
ELP '96 Proceedings of the 5th International Workshop on Extensions of Logic Programming
Logic Programming in Tau Categories
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Abstract Syntax and Variable Binding
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Journal of Logic and Computation
ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
On the algebraic structure of declarative programming languages
Theoretical Computer Science
Communications of the ACM
Monadic constraint programming
Journal of Functional Programming
Relating coalgebraic notions of bisimulation: with applications to name-passing process calculi
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Presenting functors on many-sorted varieties and applications
Information and Computation
Second-order algebraic theories
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Segal Condition Meets Computational Effects
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
A Generic Operational Metatheory for Algebraic Effects
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Equational presentations of functors and monads
Mathematical Structures in Computer Science
Transforming functional logic programs into monadic functional programs
WFLP'10 Proceedings of the 19th international conference on Functional and constraint logic programming
Coalgebraic semantics for derivations in logic programming
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Linearly-used state in models of call-by-value
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Algebraic foundations for effect-dependent optimisations
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Monads need not be endofunctors
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Normalization by Evaluation and Algebraic Effects
Electronic Notes in Theoretical Computer Science (ENTCS)
Instances of Computational Effects: An Algebraic Perspective
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Freyd categories are Enriched Lawvere Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We present an algebraic theory for a fragment of predicate logic. The fragment has disjunction, existential quantification and equality. It is not an algebraic theory in the classical sense, but rather within a new framework that we call 'parameterized algebraic theories'. We demonstrate the relevance of this algebraic presentation to computer science by identifying a programming language in which every type carries a model of the algebraic theory. The result is a simple functional logic programming language. We provide a syntax-free representation theorem which places terms in bijection with sieves, a concept from category theory. We study presentation-invariance for general parameterized algebraic theories by providing a theory of clones. We show that parameterized algebraic theories characterize a class of enriched monads.