Sciweavers

35 search results - page 4 / 7
» Boolean Algebras for Lambda Calculus
Sort
View
SAS
1997
Springer
162views Formal Methods» more  SAS 1997»
13 years 11 months ago
Exact Flow Analysis
We present a type-based flow analysis for simply typed lambda calculus with booleans, data-structures and recursion. The analysis is exact in the following sense: if the analysis ...
Christian Mossin
JLP
2010
85views more  JLP 2010»
13 years 2 months ago
Synchronous Kleene algebra
The work presented here investigates the combination of Kleene algebra with the synchrony model of concurrency from Milner's SCCS calculus. The resulting algebraic structure ...
Cristian Prisacariu
FOSSACS
2005
Springer
14 years 1 months ago
Mathematical Models of Computational and Combinatorial Structures
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...
Marcelo P. Fiore
LISP
2006
77views more  LISP 2006»
13 years 7 months ago
Expressing combinatory reduction systems derivations in the rewriting calculus
The last few years have seen the development of the rewriting calculus (also called rho-calculus or -calculus) that uniformly integrates first-order term rewriting and the -calculu...
Clara Bertolissi, Horatiu Cirstea, Claude Kirchner
AIR
2005
114views more  AIR 2005»
13 years 7 months ago
Relation Algebras and their Application in Temporal and Spatial Reasoning
Qualitative temporal and spatial reasoning is in many cases based on binary relations such as before, after, starts, contains, contact, part of, and others derived from these by r...
Ivo Düntsch