1020 search results - page 130 / 204 » Tight Semantics for Logic Programs |
126
click to vote
CORR
2002
Springer
14 years 11 months ago
2002
Springer
A relational database is inconsistent if it does not satisfy a given set of integrity constraints. Nevertheless, it is likely that most of the data in it is consistent with the co...
ICFP
2002
ACM
15 years 11 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
107
click to vote
FMCAD
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. We present a formal verification methodology for datapathdominated hardware. This provides a systematic but flexible framework within which to organize the activities und...
112
click to vote
CIE
2010
Springer
15 years 4 months ago
2010
Springer
Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as ...
110
click to vote
FLOPS
2004
Springer
15 years 5 months ago
2004
Springer
We propose a semantic framework for modelling the linear usage of continuations in typed call-by-name programming languages. On the semantic side, we introduce a construction for c...