scientific article; zbMATH DE number 7359424
From MaRDI portal
Publication:4993360
DOI10.4230/LIPIcs.FSCD.2018.28zbMath1462.68026MaRDI QIDQ4993360
David Sabel, Manfred Schmidt-Schauss
Publication date: 15 June 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Related Items (2)
Nominal Unification and Matching of Higher Order Expressions with Recursive Let ⋮ Nominal unification with letrec and environment-variables
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equivariant unification
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Nominal techniques in Isabelle/HOL
- A polynomial nominal unification algorithm
- A unification algorithm for typed \(\bar\lambda\)-calculus
- Nominal unification with atom-variables
- Checking overlaps of nominal rewriting rules
- Nominal unification of higher order expressions with recursive let
- Nominal Sets
- Algorithmics on SLP-compressed strings: A survey
- Higher-Order Dynamic Pattern Unification for Dependent Types and Records
- Nominal Completion for Rewrite Systems with Binders
- Safety of Nöcker's strictness analysis
- An Efficient Unification Algorithm
- A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
- Linear unification of higher-order patterns
- Context Unification is in PSPACE
- Computer Science Logic
- Functions-as-constructors Higher-order Unification
- An Efficient Nominal Unification Algorithm
- Automata, Languages and Programming
- General Bindings and Alpha-Equivalence in Nominal Isabelle
- Nominal Unification from a Higher-Order Perspective
This page was built for publication:
