Higher-Order Algebra, Logic, and Term Rewriting
Springer Berlin (Hersteller)
978-3-540-48579-7 (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 | 2.7.2005 |
|---|---|
| Reihe/Serie | Computer Science |
| Computer Science (R0) | Lecture Notes in Computer Science |
| Zusatzinfo | IX, 351 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Themenwelt | Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge |
| Informatik ► Theorie / Studium ► Compilerbau | |
| Schlagworte | Computational Logic • Computer-Logik • C programming language • Functional Programming • Funktionales Programmieren • Higher-Order Methoden • Higher-Order Methods • Logic • Logic Programming • programming • Programming language • Resolution • Termersetzungsverfahren • verification |
| ISBN-10 | 3-540-48579-1 / 3540485791 |
| ISBN-13 | 978-3-540-48579-7 / 9783540485797 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |