Higher-Order Algebra, Logic, and Term Rewriting
Springer Berlin (Verlag)
978-3-540-58233-5 (ISBN)
Interaction systems.- Strong normalization of typeable rewrite systems.- A transformation system combining partial evaluation with term rewriting.- Prototyping relational specifications using higher-order objects.- Origin tracking for higher-order term rewriting systems.- Theory interpretation in simple type theory.- The semantics of SPECTRUM.- ATLAS: A typed language for algebraic specification.- Compilation of Combinatory Reduction Systems.- Specification and verification in higher order algebra: A case study of convolution.- Ordered and continuous models of higher-order specifications.- Rewriting properties of combinators for rudimentary linear logic.- Comparing combinatory reduction systems and higher-order rewrite systems.- Termination proofs for higher-order rewrite systems.- Extensions of initial models and their second-order proof systems.
Erscheint lt. Verlag | 28.7.1994 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science |
Zusatzinfo | IX, 351 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 152 x 229 mm |
Gewicht | 466 g |
Themenwelt | Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge |
Informatik ► Theorie / Studium ► Compilerbau | |
Schlagworte | Computational Logic • Computer-Logik • C programming language • formale Sprachen • Functional Programming • Funktionales Programmieren • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Higher-Order Methoden • Higher-Order Methods • Logic • Logic Programming • Logisches Programmieren • Mathematische Logik • Programmablaufplan • Programmierung • programming • Programming language • Resolution • Term • Termersetzungsverfahren • Term Rewriting • Term rewriting systems • verification |
ISBN-10 | 3-540-58233-9 / 3540582339 |
ISBN-13 | 978-3-540-58233-5 / 9783540582335 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich