Dynamically-Typed Computations for Order-Sorted Equational Presentations (Extended Abstract)

Dynamically-Typed Computations for Order-Sorted Equational Presentations (Extended Abstract) (1994)

Cached

Download Links

[ftp.loria.fr]

Other Repositories/Bibliography

DBLP

by Claus Hintermeier , Claude Kirchner , Hélène Kirchner

Venue:	Proc. 21st International Colloquium on Automata, Languages, and Programming, volume 820 of Lecture Notes in Computer Science
Citations:	10 - 8 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Dynamically-Typed Computations for Order-Sorted Equational Presentations (Extended Abstract)	user correction - Legacy Corrections
AUTHOR NAME	Claus Hintermeier	user correction - Legacy Corrections
AUTHOR AFFIL	CRIN-CNRS & INRIA-Lorraine	user correction - Legacy Corrections
AUTHOR ADDR	BP239, 54506 Vandoeuvre-l`es-Nancy Cedex; France	user correction - Legacy Corrections
AUTHOR NAME	Claude Kirchner	user correction - Legacy Corrections
AUTHOR AFFIL	CRIN-CNRS & INRIA-Lorraine	user correction - Legacy Corrections
AUTHOR ADDR	BP239, 54506 Vandoeuvre-l`es-Nancy Cedex; France	user correction - Legacy Corrections
AUTHOR NAME	Hélène Kirchner	user correction - Legacy Corrections
ABSTRACT	Equational presentations with ordered sorts encompass partially defined functions and subtyping information in an algebraic framework. In this work we address the problem of computing in order-sorted algebras, with very few restrictions on the allowed presentations. We adopt an algebraic framework where equational, membership and existence formulas can be expressed. A complete deduction calculus is provided to incorporate the interaction between all these formulas. The notion of decorated terms is proposed to memorize local sort information, dynamically changed by a rewriting process. A completion procedure for equational presentations with ordered sorts computes a set of rewrite rules with which not only equational theorems of the form (t = t 0 ), but also typing theorems of the for...	user correction - Legacy Corrections
YEAR	1994	INFERENCE
VENUE	Proc. 21st International Colloquium on Automata, Languages, and Programming, volume 820 of Lecture Notes in Computer Science	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	450--461	INFERENCE
VOLUME	25	INFERENCE
CITATIONS	24 found	ParsCit 1.0