13 search results - page 2 / 3 » Weakest Precondition for General Recursive Programs Formaliz... |
SCP
2011
13 years 18 days ago
2011
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
POPL
2007
ACM
14 years 6 months ago
2007
ACM
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
POPL
2007
ACM
14 years 6 months ago
2007
ACM
Separation Logic, Ambient Logic and Context Logic are based on a similar style of reasoning about structured data. They each consist of a structural (separating) composition for r...
ICFP
2009
ACM
14 years 6 months ago
2009
ACM
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
POPL
2012
ACM
12 years 1 months ago
2012
ACM
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...