Typed generic traversal with term rewriting strategies

Typed generic traversal with term rewriting strategies is …
instance of (P31):
scholarly articleQ13442814

External links are
P8978DBLP publication IDjournals/jlp/Lammel03
P356DOI10.1016/S1567-8326(02)00028-0
P894zbMATH Open document ID1026.68076

P50authorRalf LämmelQ28009024
P2860cites workA Survey of Rewriting Strategies in Program Transformation SystemsQ59780458
Fusing Logic and Control with Local TransformationsQ59780459
A Core Language for RewritingQ59780466
How to make ad-hoc polymorphism less ad hocQ54261730
On understanding types, data abstraction, and polymorphismQ55872704
A theory of type polymorphism in programmingQ55881388
A Calculus for Overloaded Functions with SubtypingQ56145254
Dynamic typing in a statically typed languageQ56982265
A higher-order implementation of rewritingQ57382757
Generic type-preserving traversal strategiesQ57400624
CASL: the Common Algebraic Specification LanguageQ57783499
A functional theory of exceptionsQ59447202
P433issue1-2
P6104maintained by WikiProjectWikiProject MathematicsQ8487137
P304page(s)1-64
P577publication date2003-01-01
P1433published inThe Journal of Logic and Algebraic ProgrammingQ7743597
P1476titleTyped generic traversal with term rewriting strategies
P478volume54

Search more.