Memoization in type-directed partial evaluation

DOI10.1007/3-540-45821-2_5MaRDI QIDQ4440321zbMATH OpenFDO

Authors Vincent Balat, Olivier Danvy

Publication date 16 December 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2487/24870078.htm

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Computing methodologies and applications (68U99)

Recommendations

• A semantic account of type-directed partial evaluation
• Type directed partial evaluation for level-1 shift and reset
• scientific article; zbMATH DE number 2090724
• Selective Memoization with Box Types
• Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums

Cited in

(9)

• Two-level languages for program optimization
• A static simulation of dynamic delimited control
• A Compiled Implementation of Normalization by Evaluation
• From reduction-based to reduction-free normalization
• Partial evaluation, self-application and types
• Type directed partial evaluation for level-1 shift and reset
• Selective Memoization with Box Types
• Kripke models for classical logic
• Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation

This page was built for publication: Memoization in type-directed partial evaluation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4440321)