Jan Heering  Home/Search
Context Related
| cwi.nl/pub/gipe/reports/Hee92a.ps.Z cwi.nl/~jan/HO.WLP.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cwi.nl/pub/gipe/reports...reports (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Writing algebraic specifications that are to be executed as rewrite systems is similar to functional programming. There are some differences, however. Algebraic specification languages allow lefthand sides of equations to be complex first-order patterns that would not be allowed in functional languages. Functional languages, on the other hand, have powerful higher-order features not offered by algebraic specification languages. Some functional languages combine higher-order functions with... (Update)
Context of citations to this paper: More
.... order algebraic specification (Parsaye Ghomi [23] Poign e [25] Moller [19] Jouannaud and Okada [15] Meinke [17] Heering [10]) is a synthesis of Supported in part by the European Communities under ESPRIT project 2177 (Generation of Interactive Programming Environments...
...the list of the results. Contemplations about the implementation (in Prolog) of such an extension of algebraic specification appear in [Hee91]. Another option is to let the specifier specify his own operations on modules, and thus his own parameter mechanism or equivalent (...
Cited by: More
A Survey of Rewriting Strategies in Program Transformation Systems - Visser (2003) (Correct)
Term Rewriting With Traversal Functions - van den Brand, Klint, Vinju (2001) (Correct)
Syntax and Static Semantics of Eiffel - A Case Study in Algebraic .. - Visser (1992) (Correct)
Active bibliography (related documents): More All
0.5: Stream Processing I: A Survey - Stephens (1995) (Correct)
0.5: Persistence in Algebraic Specifications - Wiedijk (1991) (Correct)
0.5: A Polymorphic lambda-calculus with Type:Type - Cardelli (1986) (Correct)
Similar documents based on text: More All
0.2: Sound And Complete Translations From Sorted Higher-Order Logic.. - Kerber (1994) (Correct)
0.1: Higher-Order Narrowing - Prehofer (1994) (Correct)
0.1: Constraints to Stop Higher-Order Deforestation - Seidl, Sørensen (1997) (Correct)
Related documents from co-citation: More All
4: Algebraic specification (context) - Bergstra, Heering et al. - 1989
4: Department of Information and Computer Science (context) - Neighbors, Users - 1983
3: A logic programming approach to implementing higher-order term rewriting - Felty - 1991
BibTeX entry: (Update)
J. Heering. Implementing higher-order algebraic specifications. In D. Miller, editor, Proceedings of the 1992 Workshop on the lambdaProlog Programming Language. University of Pennsylvania, Philadelphia, 1992. Published as report MS-CIS-92-86, pages 141--157. Available by ftp from ftp.cwi.nl:/pub/gipe as Hee92a.ps.Z. http://citeseer.ist.psu.edu/heering92implementing.html More
@misc{ heering92implementing,
author = "J. Heering",
title = "Implementing higher-order algebraic specifications",
text = "J. Heering. Implementing higher-order algebraic specifications. In D. Miller,
editor, Proceedings of the 1992 Workshop on the lambdaProlog Programming
Language. University of Pennsylvania, Philadelphia, 1992. Published as report
MS-CIS-92-86, pages 141--157. Available by ftp from ftp.cwi.nl:/pub/gipe
as Hee92a.ps.Z.",
year = "1992",
url = "citeseer.ist.psu.edu/heering92implementing.html" }
Citations (may not include all citations):474 Term rewriting systems - Klop
251 A logic programming language with lambda-abstraction - Miller - 1991
166 An overview of Prolog (context) - Nadathur, Miller - 1988
127 Prolog Programming for Artificial Intelligence (context) - Bratko - 1986
126 Higher-order critical pairs (context) - Nipkow - 1991
95 Hope: an experimental applicative language - Burstall, MacQueen et al. - 1980
37 Third-order matching is decidable - Dowek - 1991
28 Implementing algebraic specifications (context) - Bouma, Walters - 1989
27 Universal algebra in higher types (context) - Meinke - 1992
23 ese de Doctorat d (context) - Huet, equations et al. - 1976
19 and computability (context) - Meseguer, Goguen et al. - 1985
16 A logic programming approach to implementing higher-order te.. - Felty - 1991
11 Annotated bibliography on partial evaluation and mixed compu.. (context) - Sestoft, Zamulin - 1988
10 Algebraic specification with higher-order operators (context) - Moller - 1987
9 A computation model for executable higher-order algebraic sp.. (context) - Jouannaud, Okada - 1991
8 completeness of algebraic specifications (context) - Heering, evaluation - 1986
5 and models with higher types (context) - Poign'e, specifications - 1986
5 Second-order algebraic specification of static semantics - Heering
2 Functional Programming with Hope (context) - Bailey - 1990
2 A recursive second order initial algebra specification of pr.. (context) - Meinke - 1991
2 Translating algebraic specifications to Prolog programs: a c.. (context) - Drosten - 1988
2 Technical Report No (context) - Paulson, Nipkow et al. - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cwi.nl/pub/gipe/reports/reports.html): More
Homomorphism Preserving Algebraic Specifications Require.. - Bergstra, Heering (1993) (Correct)
Generating Visual Editors for Formally Specified Languages - Usküdarli (1994) (Correct)
Fine-Grain Incremental Implementation of Algebraic.. - van der Meulen (1991) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC