Results 11 
13 of
13
Standard ML Type Generativity as Existential Quantification
, 1996
"... : One of the distinguishing features of Standard ML is the use of type generativity. Each declaration of a datatype binds a globally fresh type name to the type identifier introduced. Type generativity has been regarded as an extralogical device which, though desirable in a programming language to ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
: One of the distinguishing features of Standard ML is the use of type generativity. Each declaration of a datatype binds a globally fresh type name to the type identifier introduced. Type generativity has been regarded as an extralogical device which, though desirable in a programming language to ensure data abstraction, bears no close resemblance to type theoretic constructs. We show that it corresponds precisely to existential quantification over types, and use the observation to suggest proper extensions to the current static semantics of Standard ML. Keywords: language design, type theory, modules, Standard ML. 1 Introduction Standard ML[13] has a rich modules language. Core language declarations of value and type identifiers can be packaged together into possibly nested structures. Access to structure components is by the dot notation and provides good control of the name space in a large program development. Structures are transparent: the identity of type components within ...
Formalization of a Concurrent Object Calculus Up to AlphaConversion
, 1999
"... We present a formalization of a concurrent object calculus in the Calculus of Inductive Constructions. We use de Bruijn technique in an intermediate syntax, but de Bruijn indices do not appear in the final formalization of the terms of the calculus, which are still dened up to ffconversion. We deri ..."
Abstract
 Add to MetaCart
We present a formalization of a concurrent object calculus in the Calculus of Inductive Constructions. We use de Bruijn technique in an intermediate syntax, but de Bruijn indices do not appear in the final formalization of the terms of the calculus, which are still dened up to ffconversion. We derive substitution rewriting rules and an inductive principle on the subset of the terms which formalize the calculus. Once a certain amount of preliminary work has been done on the intermediate syntax this induction theorem makes possible natural proofs which do not deal with de Bruijn number.
Proof of the subject reduction property for a πcalculus in COQ
, 1999
"... This paper presents a method for coding picalculus in the COQ proof assistant, in order to use this environment to formalize properties of the picalculus. This method consists in making a syntactic discrimination between free names (then called parameters) and bound names (then called variables) o ..."
Abstract
 Add to MetaCart
This paper presents a method for coding picalculus in the COQ proof assistant, in order to use this environment to formalize properties of the picalculus. This method consists in making a syntactic discrimination between free names (then called parameters) and bound names (then called variables) of the processes, so that implicit renamings of bound names are avoided in the substitution operation. This technique has been used by J.McKinna and R.Pollack in an extensive study of PTS [5]. We use this coding here to prove subject reduction property for a type system of a monadic picalculus.