Essence of generalized partial computation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3978352 (Why is no real title available?)
- scientific article; zbMATH DE number 3655324 (Why is no real title available?)
- scientific article; zbMATH DE number 42475 (Why is no real title available?)
- scientific article; zbMATH DE number 3550181 (Why is no real title available?)
- scientific article; zbMATH DE number 3798996 (Why is no real title available?)
- A fast string searching algorithm
- A partial evaluator, and its use as a programming tool
- Eliminating Redundant Recursive Calls.
- Fast Pattern Matching in Strings
- Improving programs by the introduction of recursion
- Mixed computation: potential applications and problems for study
- Opening key-note speech
- Simplification by Cooperating Decision Procedures
- The concept of a supercompiler
- The lambda calculus, its syntax and semantics
Cited in
(8)- INSTANCE-SPECIFIC SOLUTIONS FOR ACCELERATING THE CKY PARSING OF LARGE CONTEXT-FREE GRAMMARS
- On the semantic equivalence of language syntax formalisms
- Program transformation system based on generalized partial computation
- Generalized partial computation using disunification to solve constraints
- scientific article; zbMATH DE number 1953285 (Why is no real title available?)
- From standard to non-standard semantics by semantics modifiers
- Derivation of efficient logic programs by specialization and reduction of nondeterminism
- Partial evaluation of computation process, revisited.
This page was built for publication: Essence of generalized partial computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808278)
