110
click to vote
TLCA
15 years 2 months ago
2005 Springer 
Two common misbeliefs about encodings of the λ-calculus in interaction nets (INs) are that they are good only for strategies that are not very well understood (e.g. optimal reduct...
TLCA
15 years 2 months ago
2005 Springer 
Proof animation is a way of executing proofs to nd errors in the formalization of proofs. It is intended to be \testing in proof engineering". Although the realizability inter...
TLCA
15 years 2 months ago
2005 Springer 
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
TLCA
15 years 2 months ago
2005 Springer 
Abstract. The Focal language (formerly FoC) allows one to incrementally build modules and to formally prove their correctness. In this paper, we present two formal semantics for en...
TLCA
15 years 2 months ago
2005 Springer
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
|
Theoretical Computer Science