A rewrite-based type discipline for a subset of computer algebra

DOI10.1016/S0747-7171(08)80110-1zbMath0739.68048MaRDI QIDQ1176783

Philippe Schnoebelen, Denis Lugiez, Hubert Comon

Publication date: 25 June 1992

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

polymorphismtype systemorder-sorted algebra

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Grammars and rewriting systems (68Q42)

Related Items

A rewrite-based type discipline for a subset of computer algebra

Uses Software

• IBM Scratchpad
• REDUCE
• MACSYMA
• ML

Cites Work

• Properties of substitutions and unifications
• A rewrite-based type discipline for a subset of computer algebra
• A theory of type polymorphism in programming
• Edinburgh LCF. A mechanized logic of computation
• Computational aspects of an order-sorted logic with term declarations
• Fundamentals of artificial intelligence. An advanced course
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item