Sciweavers

17 search results - page 2 / 4
» tlca 2005
Sort
View
TLCA
2005
Springer
13 years 10 months ago
Proof Contexts with Late Binding
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...
Virgile Prevosto, Sylvain Boulmé
TLCA
2005
Springer
13 years 10 months ago
Can Proofs Be Animated By Games?
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...
Susumu Hayashi
TLCA
2005
Springer
13 years 10 months ago
Relational Reasoning in a Nominal Semantics for Storage
We give a monadic semantics in the category of FM-cpos to a higher-order CBV language with recursion and dynamically allocated mutable references that may store both ground data an...
Nick Benton, Benjamin Leperchey
TLCA
2005
Springer
13 years 10 months ago
Naming Proofs in Classical Propositional Logic
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. ...
François Lamarche, Lutz Straßburger
TLCA
2005
Springer
13 years 10 months ago
Subtyping Recursive Types Modulo Associative Commutative Products
This work sets the formal bases for building tools that help retrieve classes in object-oriented libraries. In such systems, the user provides a query, formulated as a set of class...
Roberto Di Cosmo, François Pottier, Didier ...