default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 435
Volume 435, June 2012
- Matthias Blume, Germán Vidal
:
Preface. 1-2
- Stefano Berardi, Makoto Tatsuta:
Internal models of system F for decompilation. 3-20 - Olivier Danvy, Kevin Millikin, Johan Munk, Ian Zerny:
On inter-deriving small-step and big-step semantics: A case study for storeless call-by-need evaluation. 21-42 - Jacob M. Howe, Andy King:
A pearl on SAT and SMT solving in Prolog. 43-55 - Oleg Kiselyov:
Delimited control in OCaml, abstractly and concretely. 56-76 - Didier Rémy, Boris Yakobowski:
A church-style intermediate language for MLF. 77-105 - Alexis Saurin:
Böhm theorem and Böhm trees for the λμ-calculus. 106-138
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-20 23:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
