1071 search results - page 93 / 215 » The Calculus of Algebraic Constructions |
163
click to vote
TLCA
2007
Springer
16 years 9 days ago
2007
Springer
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
196
click to vote
AISC
2010
Springer
15 years 9 months ago
2010
Springer
We prove formally that the first order theory of algebraically closed fields enjoy quantifier elimination, and hence is decidable. This proof is organized in two modular parts. We ...
214
click to vote
CSFW
2000
IEEE
15 years 10 months ago
2000
IEEE
Some of the non interference properties studied in [4, 6, 18] for information flow analysis in computer systems, notably Æ , are reformulated here in a realtime setting. This is...
173
click to vote
DEXAW
2004
IEEE
15 years 10 months ago
2004
IEEE
Database-like query processing over a network of sensors has become an attractive paradigm for building sensor applications. A sensor query is characterized by data streams among ...
160
click to vote
ITP
2010
15 years 8 months ago
2010
We present a new formalization of the algebraic hierarchy in Coq, exploiting its new type class mechanism to make practical a solution formerly thought infeasible. Our approach add...