Optimizing higher-order pattern unification.

DOI10.1007/B11829MaRDI QIDQ5900734zbMATH OpenOpenAlexFDO

Authors Brigitte Pientka, Frank Pfenning

Publication date 20 April 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b11829

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Logic Programming
• Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach
• Linear unification of higher-order patterns
• Unification of higher-order patterns in linear time and space
• Unification of higher-order patterns in a simply typed lambda-calculus with finite products and terminal type

Cited in

(10)

• Unification with extended patterns
• scientific article; zbMATH DE number 1722699 (Why is no real title available?)
• Functional programming with higher-order abstract syntax and explicit substitutions
• A meta linear logical framework
• Programs using syntax with first-class binders
• Higher-order dynamic pattern unification for dependent types and records
• Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach
• Logic Programming
• Nominal Henkin semantics: simply-typed lambda-calculus models in nominal sets
• Multi-level contextual type theory

Describes a project that uses

Uses Software

• Teyjus
• Twelf

This page was built for publication: Optimizing higher-order pattern unification.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900734)