Practical Programming with Higher-Order Encodings and Dependent Types

DOI10.1007/978-3-540-78739-6_7zbMath1133.68312OpenAlexW1554667392MaRDI QIDQ5458389

Adam Poswolsky, Carsten Schuermann

Publication date: 11 April 2008

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78739-6_7

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (6)

Hybrid. A definitional two-level approach to reasoning with higher-order abstract syntax ⋮ 2-Dimensional Directed Type Theory ⋮ Curry-Style Explicit Substitutions for the Linear and Affine Lambda Calculus ⋮ A Simple Nominal Type Theory ⋮ Case Analysis of Higher-Order Data ⋮ On the Role of Names in Reasoning about λ-tree Syntax Specifications

This page was built for publication: Practical Programming with Higher-Order Encodings and Dependent Types