Sciweavers

35 search results - page 2 / 7
» Boolean Algebras for Lambda Calculus
Sort
View
CSL
2006
Springer
13 years 9 months ago
The Power of Linear Functions
Abstract. The linear lambda calculus is very weak in terms of expressive power: in particular, all functions terminate in linear time. In this paper we consider a simple extension ...
Sandra Alves, Maribel Fernández, Már...
LICS
2008
IEEE
14 years 10 hour ago
Nonlocal Flow of Control and Kleene Algebra with Tests
Kleene algebra with tests (KAT) is an equational system for program verification that combines Kleene algebra (KA), or the algebra of regular expressions, with Boolean algebra. I...
Dexter Kozen
JFP
2002
94views more  JFP 2002»
13 years 5 months ago
The lambda calculus is algebraic
Peter Selinger
ADBIS
2004
Springer
193views Database» more  ADBIS 2004»
13 years 9 months ago
Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...
Peter Z. Revesz