Higher-order substitutions
From MaRDI portal
Recommendations
Cites work
- A framework for defining logics
- A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
- A theory of binding structures and applications to rewriting
- An efficient interpreter for the lambda-calculus
- Conditional lambda-theories and the verification of static properties of programs
- Correctness of procedure representations in higher-order assembly language
- Correspondence between ALGOL 60 and Church's Lambda-notation
- Explicit substitutions
- Higher-order rewrite systems and their confluence
- scientific article; zbMATH DE number 4191621 (Why is no real title available?)
- scientific article; zbMATH DE number 4052993 (Why is no real title available?)
- scientific article; zbMATH DE number 4058907 (Why is no real title available?)
- scientific article; zbMATH DE number 65531 (Why is no real title available?)
- scientific article; zbMATH DE number 1331927 (Why is no real title available?)
- scientific article; zbMATH DE number 512788 (Why is no real title available?)
- scientific article; zbMATH DE number 3993540 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- scientific article; zbMATH DE number 3400430 (Why is no real title available?)
- Metacircularity in the polymorphic \(\lambda\)-calculus
- On theories with a combinatorial definition of 'equivalence'
- The Calculi of Lambda Conversion. (AM-6)
- The calculus of constructions
- Uniform proofs as a foundation for logic programming
Cited in
(27)- C-expressions: A variable-free calculus for equational logic programming
- Unification with extended patterns
- Substitution: A formal methods case study using monads and transformations
- CINNI -- a generic calculus of explicit substitutions and its application to -, - and -calculi
- Dependent types and explicit substitutions: A meta-theoretical development
- scientific article; zbMATH DE number 1696799 (Why is no real title available?)
- A meta lambda calculus with cross-level computation
- The theory of contexts for first order and higher order abstract syntax
- Functional programming with higher-order abstract syntax and explicit substitutions
- A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions
- scientific article; zbMATH DE number 4177054 (Why is no real title available?)
- scientific article; zbMATH DE number 3480013 (Why is no real title available?)
- scientific article; zbMATH DE number 1301856 (Why is no real title available?)
- scientific article; zbMATH DE number 1476647 (Why is no real title available?)
- scientific article; zbMATH DE number 1508928 (Why is no real title available?)
- Substitution, jumps, and algebraic effects
- scientific article; zbMATH DE number 1870536 (Why is no real title available?)
- The suspension notation for lambda terms and its use in metalanguage implementations
- scientific article; zbMATH DE number 1405633 (Why is no real title available?)
- Explicit substitutions
- scientific article; zbMATH DE number 1424037 (Why is no real title available?)
- Two-level lambda-calculus
- Programming Languages and Systems
- Substitution operators
- Simultaneous substitution in the typed lambda calculus
- Implementation of higher-order unification based on calculus of explicit substitution
- Explicit substitutions and higher-order syntax
This page was built for publication: Higher-order substitutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854398)
