Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=435
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Internal models of system F for decompilation
Stefano Berardi
,
Makoto Tatsuta
Theoretical Computer Science
435
, 2012, pp. 3-20
On inter-deriving small-step and big-step semantics: A case study for storeless call-by-need evaluation
Olivier Danvy
,
Kevin Millikin
,
Johan Munk
,
Ian Zerny
Theoretical Computer Science
435
, 2012, pp. 21-42
A pearl on SAT and SMT solving in Prolog
Jacob M. Howe
,
Andy King
Theoretical Computer Science
435
, 2012, pp. 43-55
Delimited control in OCaml, abstractly and concretely
Oleg Kiselyov
Theoretical Computer Science
435
, 2012, pp. 56-76
A church-style intermediate language for MLF
Didier Rémy
,
Boris Yakobowski
Theoretical Computer Science
435
, 2012, pp. 77-105
Böhm theorem and Böhm trees for the
\Lambda\mu
-calculus
Alexis Saurin
Theoretical Computer Science
435
, 2012, pp. 106-138