Third-order matching in the polymorphic lambda calculus
From MaRDI portal
Recommendations
Cites work
- A second-order pattern matching algorithm for the cube of typed -calculi
- Embedding first order predicate logic in fragments of intuitionistic logic
- scientific article; zbMATH DE number 29189 (Why is no real title available?)
- scientific article; zbMATH DE number 42964 (Why is no real title available?)
- scientific article; zbMATH DE number 42059 (Why is no real title available?)
- scientific article; zbMATH DE number 3485174 (Why is no real title available?)
- On equivalence classes of interpolation equations
- The calculus of constructions
- The Clausal Theory of Types
- The undecidability of pattern matching in calculi where primitive recursive functions are representable
- Third order matching is decidable
- Third-order matching in the presence of type constructors (extended abstract)
- Unification under a mixed prefix
Cited in
(6)- Third order matching is decidable
- Third-order matching in the presence of type constructors (extended abstract)
- scientific article; zbMATH DE number 29189 (Why is no real title available?)
- Higher-order matching and tree automata
- scientific article; zbMATH DE number 626035 (Why is no real title available?)
- On the complexity of higher-order matching in the linear -calculus
This page was built for publication: Third-order matching in the polymorphic lambda calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645813)