Results 1 
6 of
6
Fixpoint Equations for WellFounded Recursion in Type Theory
 THEOREM PROVING IN HIGHER ORDER LOGICS: 13TH INTERNATIONAL CONFERENCE, TPHOLS 2000, VOLUME 1869 OF LECTURE NOTES IN COMPUTER SCIENCE
, 2000
"... ..."
RegionBased Memory Management in Java
, 1998
"... We present a Javalike language in which objects are explicitly put in regions. The language has constructs for allocating, updating and deallocating regions, as well as region types for objects. For this language we present a static semantics ensuring that welltyped programs use regions safely, an ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
We present a Javalike language in which objects are explicitly put in regions. The language has constructs for allocating, updating and deallocating regions, as well as region types for objects. For this language we present a static semantics ensuring that welltyped programs use regions safely, and we present a dynamic semantics that is intentional with respect to a regionbased store. We formulate and prove a soundness theorem stating that welltyped programs do not go wrong. Finally, we develop a concrete model for implementing regions, and we compare this model to garbage collection for small examples.
Tool Support for Logics of Programs
 Mathematical Methods in Program Development: Summer School Marktoberdorf 1996, NATO ASI Series F
, 1996
"... Proof tools must be well designed if they... ..."
Constructor subtyping in the Calculus of Inductive Constructions
 Proceedings of FOSSACS'00, LNCS 1784
, 2000
"... The Calculus of Inductive Constructions (CIC) is a powerful type system, featuring dependent types and inductive definitions, that forms the basis of proofassistant systems such as Coq and Lego. We extend CIC with constructor subtyping, a basic form of subtyping in which an inductive type &sigm ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
The Calculus of Inductive Constructions (CIC) is a powerful type system, featuring dependent types and inductive definitions, that forms the basis of proofassistant systems such as Coq and Lego. We extend CIC with constructor subtyping, a basic form of subtyping in which an inductive type &sigma; is viewed as a subtype of another inductive type &tau; if &tau; has more elements than &sigma;. It is shown that the calculus is wellbehaved and provides a suitable basis for formalizing natural semantics in proofdevelopment systems.
Natural Semantics for NonDeterminism
, 1993
"... We present a natural semantics for the untyped lazy calculus plus McCarthy's amb, a nondeterministic choice operator. The natural semantics includes rules for both convergent behaviour (dened inductively) and divergent behaviour (dened coinductively). This semantics is equivalent to a smal ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We present a natural semantics for the untyped lazy calculus plus McCarthy's amb, a nondeterministic choice operator. The natural semantics includes rules for both convergent behaviour (dened inductively) and divergent behaviour (dened coinductively). This semantics is equivalent to a small step reduction semantics that corresponds closely to our operational intuitions about McCarthy's amb. We present equivalences for convergent and divergent behaviour based on the natural semantics and prove a Context Lemma for the convergence equivalence. We then give a theory l 8 , based on the equivalences for convergent and divergent behaviour. Since it is able to distinguish between programs that dier only in their divergent behaviour, the theory is more discriminating than equational theories based on current domaintheoretic models. It is therefore more suitable for reasoning about functional programs containing McCarthy's amb. Contents 1 Introduction 2 2 Related Work 3 3 ...
Logic Programming and CoInductive Definitions
, 1998
"... This paper focuses on the assignment of meaning to infinite derivations in logic programming. Several approaches have been developped by considering infinite elements in the universe of the discourse but none are complete. By considering proofs as objects in a coinductive set, standard properties o ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper focuses on the assignment of meaning to infinite derivations in logic programming. Several approaches have been developped by considering infinite elements in the universe of the discourse but none are complete. By considering proofs as objects in a coinductive set, standard properties of coinductive definitions are used both to explain this incompleteness and to define a sound and complete semantics, based on the logic program as coinductive denition paradigm, for a subclass of infinite derivations, called infinite derivations over a finite domain (i.e. derivations which do not compute infinite terms).