Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions
From MaRDI portal
Publication:2866332
DOI10.1016/j.entcs.2006.10.037zbMath1277.68050MaRDI QIDQ2866332
Publication date: 13 December 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2006.10.037
68N18: Functional programming and lambda calculus
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing with contexts
- A Coverage Checking Algorithm for LF
- A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
- A framework for defining logics
- Logic Programming
- Contextual modal type theory
- Typed Lambda Calculi and Applications
- Automated Deduction – CADE-19
- A polymorphic environment calculus and its type-inference algorithm
- A typed context calculus