default search action
1. HOA 1993: Amsterdam, The Netherlands
- Jan Heering, Karl Meinke, Bernhard Möller, Tobias Nipkow:
Higher-Order Algebra, Logic, and Term Rewriting, First International Workshop, HOA '93, Amsterdam, The Netherlands, September 23-24, 1993, Selected Papers. Lecture Notes in Computer Science 816, Springer 1994, ISBN 3-540-58233-9 - Andrea Asperti, Cosimo Laneve:
Interaction Systems. 1-19 - Steffen van Bakel, Maribel Fernández:
Strong Normalization of Typeable Rewrite Systems. 20-39 - Françoise Bellegarde:
A Transformation System Combining Partial Evaluation with Term Rewriting. 40-55 - Rudolf Berghammer, Thomas F. Gritzner, Gunther Schmidt:
Prototyping Relational Specifications Using Higher-Order Objects. 56-75 - Arie van Deursen, T. B. Dinesh:
Origin Tracking for Higher-Order Term Rewriting Systems. 76-95 - William M. Farmer:
Theory Interpretation in Simple Type Theory. 96-123 - Radu Grosu, Franz Regensburger:
The Semantics of SPECTRUM. 124-145 - B. M. Hearn, Karl Meinke:
ATLAS: A Typed Language for Algebraic Specification. 146-168 - Stefan Kahrs:
Compilation of Combinatory Reduction Systems. 169-188 - Karl Meinke, L. J. Steggles:
Specification and Verification in Higher-Order Algebra: A Case Study of Convolution. 189-222 - Bernhard Möller:
Ordered and Continuous Models of Higher-Order Specifications. 223-255 - Monica Nesi, Valeria de Paiva, Eike Ritter:
Rewriting Properties of Combinators for Rudimentary Linear Logic. 256-275 - Vincent van Oostrom, Femke van Raamsdonk:
Comparing Combinatory Reduction Systems and Higher-order Rewrite Systems. 276-304 - Jaco van de Pol:
Termination Proofs for Higher-order Rewrite Systems. 305-325 - Pierre-Yves Schobbens:
Extensions of Initial Models and their Second-Order Proof Systems. 326-344
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.