AbstractWe study how the type theory Fω can be adequately represented in the meta-logical framework Twelf [16]. This development puts special emphasis on the way how terms, types, and kinds are represented in that it uses higher-order abstract syntax to model variable binding and dependent types to model typing constraints. Furthermore our design ensures that only well-typed terms and well-kinded types can be constructed. A possible application of this work lies in the development of safe intermediate languages for compilation
Abstract. Refinement types sharpen systems of simple and dependent types by offering expressive mean...
Our objective is to understand the notion of type in programming languages, present a model of typed...
AbstractMLF is a type system that seamlessly merges ML-style implicit but second-class polymorphism ...
AbstractWe study how the type theory Fω can be adequately represented in the meta-logical framework ...
In this paper, we present an existing and formalized type theory (UTT) as a logical framework. We co...
A functional language is introduced, whose type system is defined by its meta-circular interpreter. ...
This paper concerns techniques for providing a convenient syntax for object languages implemented vi...
We discuss different ways to represent the syntax of dependent types using Martin-Lof type theory as...
It is possible to represent the terms of a syntax with binding constructors by a family of types, in...
International audienceGenerally, ontological relations are modeled using fragments of first order lo...
We present the type theory LTT, intended to form a basis for typed target languages, providing an in...
We propose a refinement of the type theory underlying the LF logical framework by a form of subtypes...
We describe a recent formalization of several results from the metatheory of Pure Type Systems (PTSs...
© 2017 Copyright held by the owner/author(s). Meta-programs are programs that generate other program...
We present the type theory LTT, intended to form a basis for typed target languages, providing an in...
Abstract. Refinement types sharpen systems of simple and dependent types by offering expressive mean...
Our objective is to understand the notion of type in programming languages, present a model of typed...
AbstractMLF is a type system that seamlessly merges ML-style implicit but second-class polymorphism ...
AbstractWe study how the type theory Fω can be adequately represented in the meta-logical framework ...
In this paper, we present an existing and formalized type theory (UTT) as a logical framework. We co...
A functional language is introduced, whose type system is defined by its meta-circular interpreter. ...
This paper concerns techniques for providing a convenient syntax for object languages implemented vi...
We discuss different ways to represent the syntax of dependent types using Martin-Lof type theory as...
It is possible to represent the terms of a syntax with binding constructors by a family of types, in...
International audienceGenerally, ontological relations are modeled using fragments of first order lo...
We present the type theory LTT, intended to form a basis for typed target languages, providing an in...
We propose a refinement of the type theory underlying the LF logical framework by a form of subtypes...
We describe a recent formalization of several results from the metatheory of Pure Type Systems (PTSs...
© 2017 Copyright held by the owner/author(s). Meta-programs are programs that generate other program...
We present the type theory LTT, intended to form a basis for typed target languages, providing an in...
Abstract. Refinement types sharpen systems of simple and dependent types by offering expressive mean...
Our objective is to understand the notion of type in programming languages, present a model of typed...
AbstractMLF is a type system that seamlessly merges ML-style implicit but second-class polymorphism ...