Pages that link to "Item:Q5053011"
From MaRDI portal
The following pages link to A logic programming language with lambda-abstraction, function variables, and simple unification (Q5053011):
Displaying 20 items.
- Existential type systems between Church and Curry style (type-free style) (Q402117) (← links)
- A theory of binding structures and applications to rewriting (Q685380) (← links)
- Developing developments (Q1392147) (← links)
- Normalisation for higher-order calculi with explicit substitutions (Q1770414) (← links)
- Higher order unification via explicit substitutions (Q1854337) (← links)
- Middle-out reasoning for synthesis and induction (Q1915136) (← links)
- Cut elimination for a logic with induction and co-induction (Q1948276) (← links)
- Constraint handling rules with binders, patterns and generic quantification (Q4592722) (← links)
- Higher-Ranked Annotation Polymorphic Dependency Analysis (Q5041115) (← links)
- Rewriting, and equational unification: the higher-order cases (Q5055746) (← links)
- A restricted form of higher-order rewriting applied to an HDL semantics (Q5055839) (← links)
- Problems in rewriting III (Q5055847) (← links)
- Higher-order superposition for dependent types (Q5055856) (← links)
- Higher-order families (Q5055875) (← links)
- Higher order disunification: Some decidable cases (Q5096304) (← links)
- Higher order conditional rewriting and narrowing (Q5096313) (← links)
- Representing proof transformations for program optimization (Q5210798) (← links)
- Decidable higher-order unification problems (Q5210802) (← links)
- Context rewriting (Q5881173) (← links)
- Inductive-data-type systems (Q5958292) (← links)
