Sciweavers

397 search results - page 55 / 80
» The lambda calculus is algebraic
Sort
View
ICTAI
2007
IEEE
15 years 6 months ago
Qualitative Constraints Representation for the Time and Space in SAT
In this paper we consider the consistency problem of temporal or spatial qualitive constraint networks. A new encoding making it possible to represent and solve this problem in th...
Jean-François Condotta, Dominique D'Almeida
ICFP
2003
ACM
15 years 5 months ago
Reasoning about recursive procedures with parameters
In this paper we extend the model of program variables from the Refinement Calculus [2] in order to be able to reason more algebraically about recursive procedures with parameter...
Ralph-Johan Back, Viorel Preoteasa
TLCA
1993
Springer
15 years 3 months ago
A Logic for Parametric Polymorphism
In this paper we introduce a logic for parametric polymorphism. Just as LCF is a logic for the simply-typed λ-calculus with recursion and arithmetic, our logic is a logic for Sys...
Gordon D. Plotkin, Martín Abadi
LOGCOM
2010
152views more  LOGCOM 2010»
14 years 6 months ago
Constructive Logic with Strong Negation as a Substructural Logic
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...
Manuela Busaniche, Roberto Cignoli
OTM
2005
Springer
15 years 5 months ago
Probabilistic Ontologies and Relational Databases
The relational algebra and calculus do not take the semantics of terms into account when answering queries. As a consequence, not all tuples that should be returned in response to ...
Octavian Udrea, Yu Deng, Edward Hung, V. S. Subrah...