Embedding F

Authors:
Sam Lindley
Affiliations:
University of Strathclyde, Glasgow, United Kingdom
Venue:
Proceedings of the 8th ACM SIGPLAN workshop on Generic programming
Year:
2012

Citing 22
Cited 0

Higher-order abstract syntax

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Proofs and types

Proofs and types
Metacircularity in the polymorphic &lgr;-calculus

TAPSOFT '89 2nd international joint conference on Theory and practice of software development
Intensional polymorphism in type-erasure semantics

ICFP '98 Proceedings of the third 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
Monadic Presentations of Lambda Terms Using Generalized Inductive Types

CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Type-FUNCTIONAL PEARL safe cast

Journal of Functional Programming
A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type Theory Should Eat Itself

Electronic Notes in Theoretical Computer Science (ENTCS)
Typed self-representation

Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
Syntax for Free: Representing Syntax with Binding Using Parametricity

TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
QML: explicit first-class polymorphism for ML

Proceedings of the 2009 ACM SIGPLAN workshop on ML
Unembedding domain-specific languages

Proceedings of the 2nd ACM SIGPLAN symposium on Haskell
Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages

Journal of Functional Programming
A formalisation of a dependently typed language as an inductive-recursive family

TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Outrageous but meaningful coincidences: dependent type-safe syntax and evaluation

Proceedings of the 6th ACM SIGPLAN workshop on Generic programming
Typed self-interpretation by pattern matching

Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Towards typing for small-step direct reflection

PEPM '12 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation
Staged computation with staged lexical scope

ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Strongly Typed Term Representations in Coq

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

This millennium has seen a great deal of research into embedded domain-specific languages. Primarily, such languages are simply-typed. Focusing on System F, we demonstrate how to embed polymorphic domain specific languages in Haskell and OCaml. We exploit recent language extensions including kind polymorphism and first-class modules.