Adding equations to system f types

Authors:
Neelakantan R. Krishnaswami;Nick Benton
Affiliations:
Max Planck Institute for Software Systems, Germany;Microsoft Research
Venue:
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Year:
2012

Citing 17
Cited 1

Implementing mathematics with the Nuprl proof development system

Implementing mathematics with the Nuprl proof development system
Abstract types have existential type

ACM Transactions on Programming Languages and Systems (TOPLAS)
The calculus of constructions

Information and Computation - Semantics of Data Types
Formal parametric polymorphism

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The definition of extended ML: a gentle introduction

Theoretical Computer Science - Special issue: algebraic development techniques
A Logic for Parametric Polymorphism

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
A Model for Formal Parametric Polymorphism: A PER Interpretation for System R

TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Deforestation for Higher-Order Functions

Proceedings of the 1992 Glasgow Workshop on Functional Programming
Simple unification-based type inference for GADTs

Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
The Girard—Reynolds isomorphism (second edition)

Theoretical Computer Science
Domain-theoretical models of parametric polymorphism

Theoretical Computer Science
Weak βη -Normalization and Normalization by Evaluation for System F

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Syntax for Free: Representing Syntax with Binding Using Parametricity

TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Non-parametric parametricity

Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
F-ing modules

Proceedings of the 5th ACM SIGPLAN workshop on Types in language design and implementation
Realisability semantics of parametric polymorphism, general references and recursive types

Mathematical Structures in Computer Science
Parametricity and dependent types

Proceedings of the 15th ACM SIGPLAN international conference on Functional programming

Nominal Lambda Calculus: An Internal Language for FM-Cartesian Closed Categories

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an extension of System F with types for term-level equations. This internalization of the rich equational theory of the polymorphic lambda calculus yields an expressive core language, suitable for formalizing features such as Haskell's rewriting rules mechanism or Extended ML signatures.