R n - and G n -logics
From MaRDI portal
Publication:4645806
DOI10.1007/3-540-61254-8_21zbMath1434.03083OpenAlexW1413917610WikidataQ57783590 ScholiaQ57783590MaRDI QIDQ4645806
Hélène Kirchner, Peter D. Mosses, Claus Hintermeier
Publication date: 11 January 2019
Published in: Higher-Order Algebra, Logic, and Term Rewriting (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61254-8_21
Uses Software
Cites Work
- Orderings for term-rewriting systems
- Equational type logic
- Investigations in many-sorted quantor logic
- A rationale for conditional equational programming
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- Universal algebra in higher types
- Dynamically typed computations for order-sorted equational presentations
- The foundation of a generic theorem prover
- Higher order data types
- Coherence of subsumption, minimum typing and type-checking in F ≤
- Data Types as Lattices
- Completeness in the theory of types
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: R n - and G n -logics