Titlebook: Higher-Order Algebra, Logic, and Term Rewriting; First International Jan Heering,Karl Meinke,Tobias Nipkow Conference proceedings 1994 Spr

Reservation

Cryptic

Prototyping relational specifications using higher-order objects,n-algebraic descriptions of higher-order objects. From non-constructive characterizations executable relational specifications are obtained. We also show how to develop more efficient algorithms from the frequently inefficient specifications within the calculus of binary relations.

出血

Origin tracking for higher-order term rewriting systems, of subterms, the ., in the initial term. Origin tracking is based on the notion of residuals. It has been used successfully for the generation of error handlers and debuggers from algebraic specifications of programming languages. Recent experiments with the use of higher-order algebraic specificat

植物學

Theory interpretation in simple type theory,nce as well as in logic itself. This paper presents a method for theory interpretation in a version of simple type theory, called ., which admits partial functions and subtypes. The method is patterned on the standard approach to theory interpretation in first-order logic. Although the method is bas

多余

The semantics of SPECTRUM,n calculus and a development methodology. An informal presentation of the . language with many examples illustrating its properties is given in [2, 3]. The purpose of this article is to describe its formal semantics.

輕快帶來危險

: A typed language for algebraic specification, abstract types and combinators developed in Meinke [1991, 1992b]. The system is intended to support the execution of equational specifications of abstract types and combinators. The type checking algorithms of the system also allow it to function as a framework for defining logics and proof checkin

蜈蚣

散步

Specification and verification in higher order algebra: A case study of convolution, systolic synchronous concurrent algorithms (SCAs) for convolution are formally specified and verified using higher order equational logic. We then study the metamathematics of these verification proofs by means of non-standard models.

anniversary

CLEAR

Comparing combinatory reduction systems and higher-order rewrite systems,fined by Nipkow. Although it always has been obvious that both formats are closely related to each other, up to now the exact relationship between them has not been clear. This was an unsatisfying situation since it meant that proofs for much related frameworks were given twice. We present two trans