Essence of generalized partial computation

DOI10.1016/0304-3975(91)90299-HzbMath0731.68074MaRDI QIDQ808278

Yoshihiko Futamura, Akihiko Takano, Kenroku Nogi

Publication date: 1991

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

theorem provingprogram optimizationpartial computation

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Generalized partial computation using disunification to solve constraints ⋮ On the semantic equivalence of language syntax formalisms ⋮ INSTANCE-SPECIFIC SOLUTIONS FOR ACCELERATING THE CKY PARSING OF LARGE CONTEXT-FREE GRAMMARS ⋮ Program transformation system based on generalized partial computation ⋮ FROM STANDARD TO NON-STANDARD SEMANTICS BY SEMANTICS MODIFIERS ⋮ Derivation of efficient logic programs by specialization and reduction of nondeterminism

Uses Software

• Refal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Opening key-note speech
• The lambda calculus, its syntax and semantics
• Mixed computation: potential applications and problems for study
• A partial evaluator, and its use as a programming tool
• Eliminating Redundant Recursive Calls.
• A fast string searching algorithm
• The concept of a supercompiler
• Simplification by Cooperating Decision Procedures
• Improving programs by the introduction of recursion
• Fast Pattern Matching in Strings