Skip to search formSkip to main contentSkip to account menu
Simple unification-based type inference for GADTs
TLDR
Wobbly types are presented, which express in a declarative way the uncertainty caused by the incremental nature of typical type-inference algorithms.
View on ACM
Mechanized Metatheory for the Masses: The PoplMark Challenge
TLDR
An initial set of benchmarks for measuring progress in this area of programming languages are proposed, based on the metatheory of System F<:, a typed lambda-calculus with second-order polymorphism, subtyping, and records.
View via Publisher
TALx86: A Realistic Typed Assembly Language∗
The goal of typed assembly language (TAL) is to provide a low-level, statically typed target language that is better suited than Java bytecodes for supporting a wide variety of source languages and a…
Engineering formal metatheory
TLDR
This work proposes a novel style for formalizing metatheory, combining locally nameless representation of terms and cofinite quantification of free variable names in inductivedefinitions of relations on terms, leading to developments that are faithful to informal practice, yet require noexternal tool support and little infrastructure within the proof assistant.
View on ACM
Practical type inference for arbitrary-rank types
TLDR
This paper presents a complete type-inference engine, written in Haskell, for a traditional Damas-Milner type system, and shows how to extend it for higher-rank types.
View on Cambridge Press
Reactive noninterference
TLDR
This work defines a simple reactive language with an information-flow type system and develops a proof technique for showing that program behaviors are secure according to this definition, and demonstrates the viability of the approach.
View on ACM
Flexible type analysis
TLDR
The language LX is presented, which provides a rich language of type constructors supporting type analysis (possibly of previous-stage types) as a programming idiom, and is quite flexible, supporting a variety of other applications such as analysis of quantified types, analysis with incomplete type information, and type classes.
View on ACM
Giving Haskell a promotion
TLDR
An experiment is described that enriches Haskell's kind system with two features promoted from its type system: data types and polymorphism.
View on ACM
AspectML: A polymorphic aspect-oriented functional programming language
TLDR
AspectML allows programmers to define type-safe polymorphic advice using pointcuts constructed from a collection of polymorphic join points, and comes equipped with a type inference algorithm that conservatively extends Hindley--Milner type inference.
View on ACM
Resource bound certification
TLDR
This work presents a decidable type system capable of specifying and certifying bounds on resource consumption, and provides a fully automatic compiler generating certified executables from source-level programs.
View on ACM
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License