A functional language is introduced, whose type system is defined by its meta-circular interpreter. The functional language is an extension of λ-calculus augmented with the rule for conditional terms that allows the condition of a conditional term to be used for reducing its branches. This makes it possible to deduce the well-typing of terms with dependent types including the meta-circular interpreter. In the type system built by the interpreter, types are represented by ordinary terms, which reflects the recent object-oriented programming languages, in which classes are manipulated as ordinary objects. The paper first discusses the untyped system of the functional language and its consistency, then develops the representation of types and ...
Finding typed encodings of object-oriented into procedural or functional programming sheds light on ...
© 2017 Copyright held by the owner/author(s). Meta-programs are programs that generate other program...
We present a functional programming language based on Pure Type Systems PTSs. We show how we can de...
A functional language is introduced, whose type system is defined by its meta-circular interpreter. ...
AbstractIn [12] we defined the λ&-calculus, a simple extension of the typed λ-calculus to model type...
Meta-programming is a discipline of writing programs in a certain programming language that generate...
This thesis addresses the problem of avoiding errors in functionalprograms. The thesis has three par...
AbstractWe report our experience with exploring a new point in the design space for formal reasoning...
AbstractThe type-free λ-calculus is powerful enough to contain all the polymorphic and higher-order ...
The type-free ¿-calculus is powerful enough to contain all the polymorphic and higher-order nature o...
There exists an identifiable programming style based on the widespread use of type information handl...
AbstractWe study how the type theory Fω can be adequately represented in the meta-logical framework ...
Our objective is to understand the notion of type in programming languages, present a model of typed...
A definitional interpreter is an interpreter which uses the semantics of its own host language to de...
International audienceWe present a type system over language definitions that classifies parts of th...
Finding typed encodings of object-oriented into procedural or functional programming sheds light on ...
© 2017 Copyright held by the owner/author(s). Meta-programs are programs that generate other program...
We present a functional programming language based on Pure Type Systems PTSs. We show how we can de...
A functional language is introduced, whose type system is defined by its meta-circular interpreter. ...
AbstractIn [12] we defined the λ&-calculus, a simple extension of the typed λ-calculus to model type...
Meta-programming is a discipline of writing programs in a certain programming language that generate...
This thesis addresses the problem of avoiding errors in functionalprograms. The thesis has three par...
AbstractWe report our experience with exploring a new point in the design space for formal reasoning...
AbstractThe type-free λ-calculus is powerful enough to contain all the polymorphic and higher-order ...
The type-free ¿-calculus is powerful enough to contain all the polymorphic and higher-order nature o...
There exists an identifiable programming style based on the widespread use of type information handl...
AbstractWe study how the type theory Fω can be adequately represented in the meta-logical framework ...
Our objective is to understand the notion of type in programming languages, present a model of typed...
A definitional interpreter is an interpreter which uses the semantics of its own host language to de...
International audienceWe present a type system over language definitions that classifies parts of th...
Finding typed encodings of object-oriented into procedural or functional programming sheds light on ...
© 2017 Copyright held by the owner/author(s). Meta-programs are programs that generate other program...
We present a functional programming language based on Pure Type Systems PTSs. We show how we can de...