Sciweavers

77 search results - page 10 / 16
» Algebras for Parameterised Monads
Sort
View
CORR
2007
Springer
151views Education» more  CORR 2007»
13 years 9 months ago
The algebraicity of the lambda-calculus
Abstract. We propose a new definition for abstract syntax (with binding constructions), and, accordingly, for initial semantics and algebraicity. Our definition is based on the n...
André Hirschowitz, Marco Maggesi
ENTCS
2002
125views more  ENTCS 2002»
13 years 9 months ago
Specification of Logic Programming Languages from Reusable Semantic Building Blocks
We present a Language Prototyping System that facilitates the modular development of interpreters from independent semantic buildks. The abstract syntax is modelled as the fixpoint...
José Emilio Labra Gayo, Juan Manuel Cueva L...
PODS
1999
ACM
89views Database» more  PODS 1999»
14 years 2 months ago
Type Inference in the Polymorphic Relational Algebra
We give a polymorphic account of the relational algebra. We introduce a formalism of \type formulas" speci cally tuned for relational algebra expressions, and present an algo...
Jan Van den Bussche, Emmanuel Waller
ICLP
1999
Springer
14 years 2 months ago
Algebra of Logic Programming
A declarative programming language has two kinds of semantics. The tract helps in reasoning about speci cations and correctness, while an operational semantics determines the mann...
Silvija Seres, J. Michael Spivey, C. A. R. Hoare
JUCS
2010
107views more  JUCS 2010»
13 years 8 months ago
Algebras and Update Strategies
: The classical (Bancilhon-Spyratos) correspondence between view update translations and views with a constant complement reappears more generally as the correspondence between upd...
Michael Johnson, Robert D. Rosebrugh, Richard Wood