System F with type equality coercions

Authors:
Martin Sulzmann;Manuel M. T. Chakravarty;Simon Peyton Jones;Kevin Donnelly
Affiliations:
National University of Singapore;University of New South Wales;Microsoft Research Ltd, Cambridge, England;Microsoft Research Ltd, Cambridge, England
Venue:
TLDI '07 Proceedings of the 2007 ACM SIGPLAN international workshop on Types in languages design and implementation
Year:
2007

Citing 31
Cited 48

Unification revisited

Foundations of deductive databases and logic programming
Polymorphic type inference and containment

Logical foundations of functional programming
Rewrite systems

Handbook of theoretical computer science (vol. B)
Inheritance as implicit coercion

Information and Computation
Formal parametric polymorphism

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the type structure of standard ML

ACM Transactions on Programming Languages and Systems (TOPLAS)
Polymorphic type inference and abstract data types

ACM Transactions on Programming Languages and Systems (TOPLAS)
Compiling polymorphism using intensional type analysis

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type classes in Haskell

ACM Transactions on Programming Languages and Systems (TOPLAS)
Flexible type analysis

Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Term rewriting and all that

Term rewriting and all that
Type-safe cast: (functional pearl)

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Typed compilation of inclusive subtyping

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Fully reflexive intensional type analysis

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Types and programming languages

Types and programming languages
Typing dynamic typing

Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
A lightweight implementation of generics and dynamics

Proceedings of the 2002 ACM SIGPLAN workshop on Haskell
Coercive subtyping for the calculus of constructions

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Guarded recursive datatype constructors

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A type system for higher-order modules

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Coercion and type inference

POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The view from the left

Journal of Functional Programming
Languages of the future

OOPSLA '04 Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
Associated types with class

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A type system for certified binaries

ACM Transactions on Programming Languages and Systems (TOPLAS)
Associated type synonyms

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
The role of type equality in meta-programming

The role of type equality in meta-programming
Stratified type inference for generalized algebraic data types

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Simple unification-based type inference for GADTs

Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Modular type classes

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A framework for extended algebraic data types

FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming

Data parallel Haskell: a status report

Proceedings of the 2007 workshop on Declarative aspects of multicore programming
A type-preserving closure conversion in haskell

Haskell '07 Proceedings of the ACM SIGPLAN workshop on Haskell workshop
The swiss coercion

PLPV '07 Proceedings of the 2007 workshop on Programming languages meets program verification
Observational equality, now!

PLPV '07 Proceedings of the 2007 workshop on Programming languages meets program verification
AURA: a programming language for authorization and audit

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Type checking with open type functions

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
A type-preserving compiler in Haskell

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Flask: staged functional programming for sensor networks

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Clase: cursor library for a structured editor

Proceedings of the first ACM SIGPLAN symposium on Haskell
A comparison of c++ concepts and haskell type classes

Proceedings of the ACM SIGPLAN workshop on Generic programming
Uniqueness Typing Simplified

Implementation and Application of Functional Languages
A foundation for flow-based program matching: using temporal logic and model checking

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type invariants for Haskell

Proceedings of the 3rd workshop on Programming languages meets program verification
A theory of typed coercions and its applications

Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Complete and decidable type inference for GADTs

Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Types are calling conventions

Proceedings of the 2nd ACM SIGPLAN symposium on Haskell
Finding the needle: stack traces for GHC

Proceedings of the 2nd ACM SIGPLAN symposium on Haskell
A Purely Definitional Universal Domain

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Witnessing Purity, Constancy and Mutability

APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
From higher-order logic to Haskell: there and back again

Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
F-ing modules

Proceedings of the 5th ACM SIGPLAN workshop on Types in language design and implementation
Strengthening the Zipper

Electronic Notes in Theoretical Computer Science (ENTCS)
An llVM backend for GHC

Proceedings of the third ACM Haskell symposium on Haskell
Supercompilation by evaluation

Proceedings of the third ACM Haskell symposium on Haskell
Functional pearl: every bit counts

Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
A certified framework for compiling and executing garbage-collected languages

Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Generic programming with c++ concepts and haskell type classes: A comparison

Journal of Functional Programming
Blame for all

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Generative type abstraction and type-level computation

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Taming code explosion in supercompilation

Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation
A lean specification for GADTs: system F with first-class equality proofs

Higher-Order and Symbolic Computation
Canonicity for 2-dimensional type theory

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Programming with binders and indexed data-types

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Giving Haskell a promotion

TLDI '12 Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation
Outsidein(x) modular type inference with local assumptions

Journal of Functional Programming - Dedicated to ICFP 2009
ΠΣ: dependent types without the sugar

FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
A church-style intermediate language for MLF

Theoretical Computer Science
The right kind of generic programming

Proceedings of the 8th ACM SIGPLAN workshop on Generic programming
The HERMIT in the machine: a plugin for the interactive transformation of GHC core language programs

Proceedings of the 2012 Haskell Symposium
Vectorisation avoidance

Proceedings of the 2012 Haskell Symposium
Equality proofs and deferred type errors: a compiler pearl

Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Fixing idioms: a recursion primitive for applicative DSLs

PEPM '13 Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation
HALO: haskell to logic through denotational semantics

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
System FC with explicit kind equality

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
The Intel labs Haskell research compiler

Proceedings of the 2013 ACM SIGPLAN symposium on Haskell
Hasochism: the pleasure and pain of dependently typed haskell programming

Proceedings of the 2013 ACM SIGPLAN symposium on Haskell
Closed type families with overlapping equations

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
The HERMIT in the stream: fusing stream fusion's concatMap

Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce System FC, which extends System F with support for non-syntactic type equality. There are two main extensions: (i) explicit witnesses for type equalities, and (ii) open, non-parametric type functions, given meaning by top-level equality axioms. Unlike System F, FC is expressive enough to serve as a target for several different source-language features, including Haskell's newtype, generalised algebraic data types, associated types, functional dependencies, and perhaps more besides.