[图书][B] Modern compiler design

D Grune, K Van Reeuwijk, HE Bal, CJH Jacobs… - 2012 - books.google.com
" Modern Compiler Design" makes the topic of compiler design more accessible by focusing
on principles and techniques of wide application. By carefully distinguishing between the …

Making a fast curry: push/enter vs. eval/apply for higher-order languages

S Marlow, SP Jones - ACM SIGPLAN Notices, 2004 - dl.acm.org
Higher-order languages that encourage currying are implemented using one of two basic
evaluation models: push/enter or eval/apply. Implementors use their intuition and qualitative …

On the simply-typed functional machine calculus: Categorical semantics and strong normalisation

C Barrett - arXiv preprint arXiv:2305.16073, 2023 - arxiv.org
The Functional Machine Calculus (FMC) was recently introduced as a generalization of the
lambda-calculus to include higher-order global state, probabilistic and non-deterministic …

Making a fast curry: push/enter vs. eval/apply for higher-order languages

S Marlow, SP Jones - Journal of Functional Programming, 2006 - cambridge.org
Higher-order languages that encourage currying are typically implemented using one of two
basic evaluation models: push/enter or eval/apply. Implementors use their intuition and …

A synthetic operational account of call-by-need evaluation

O Danvy, I Zerny - Proceedings of the 15th symposium on principles and …, 2013 - dl.acm.org
We present the first operational account of call by need that connects syntactic theory and
implementation practice. Syntactic theory: the storeless operational semantics using syntax …

Sequent calculi and abstract machines

ZM Ariola, A Bohannon, A Sabry - ACM Transactions on Programming …, 2009 - dl.acm.org
We propose a sequent calculus derived from the λ―μμ̃-calculus of Curien and Herbelin that
is expressive enough to directly represent the fine details of program evaluation using …

The Functional Machine Calculus III: Choice (Early Announcement)

W Heijltjes - arXiv preprint arXiv:2411.04615, 2024 - arxiv.org
The Functional Machine Calculus (Heijltjes 2022) is an extension of the lambda-calculus
that preserves confluent reduction and typed termination, while enabling both call-by-name …

Formally defining and iterating infinite models

B Combemale, X Thirioux, B Baudry - International Conference on Model …, 2012 - Springer
The wide adoption of MDE raises new situations where we need to manipulate very large
models or even infinite model streams gathered at runtime (eg, monitoring). These new uses …

The functional machine calculus

W Heijltjes - Electronic Notes in Theoretical Informatics and …, 2023 - entics.episciences.org
This paper presents the Functional Machine Calculus (FMC) as a simple model of higher-
order computation with" reader/writer" effects: higher-order mutable store, input/output, and …

Compilation of a specialized functional language for massively parallel computers

P Fradet, J Mallet - Journal of Functional Programming, 2000 - cambridge.org
We propose a parallel specialized language that ensures portable and cost-predictable
implementations on parallel computers. The language is basically a first-order, recursion …