Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             62 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A call-by-name lambda-calculus machine Krivine, Jean-Louis
2007
3 p. 199-207
artikel
2 An investigation of Jones optimality and BTI-universal specializers Glück, Robert
2008
3 p. 283-309
artikel
3 A Polymorphic Environment Calculus and its Type-Inference Algorithm Shin-Ya Nishizaki
2000
3 p. 239-278
40 p.
artikel
4 A Polymorphic Environment Calculus and its Type-Inference Algorithm Nishizaki, Shin-Ya
2000
3 p. 239-278
artikel
5 A proof of Moessner’s theorem by coinduction Niqui, M.
2012
3 p. 191-206
artikel
6 A Retrospective on Region-Based Memory Management Mads Tofte
2004
3 p. 245-265
21 p.
artikel
7 A Retrospective on Region-Based Memory Management Tofte, Mads
2004
3 p. 245-265
artikel
8 A Syntactic Theory of Dynamic Binding Luc Moreau
1998
3 p. 233-279
47 p.
artikel
9 A Syntactic Theory of Dynamic Binding Moreau, Luc
1998
3 p. 233-279
artikel
10 A type-theoretic foundation of delimited continuations Ariola, Zena M.
2007
3 p. 233-273
artikel
11 A verified framework for higher-order uncurrying optimizations Dargaye, Zaynah
2010
3 p. 199-231
artikel
12 Comparing Parallel Functional Languages Programming and Performance H.-W. Loidl
2003
3 p. 203-251
49 p.
artikel
13 Comparing Parallel Functional Languages: Programming and Performance Loidl, H.-W.
2003
3 p. 203-251
artikel
14 Compiler Optimization Correctness by Temporal Logic David Lacey
2004
3 p. 173-206
34 p.
artikel
15 Compiler Optimization Correctness by Temporal Logic Lacey, David
2004
3 p. 173-206
artikel
16 Composable Semantic Models for Actor Theories Carolyn L. Talcott
1998
3 p. 281-343
63 p.
artikel
17 Composable Semantic Models for Actor Theories Talcott, Carolyn L.
1998
3 p. 281-343
artikel
18 Context-sensitive analysis without calling-context Lakhotia, Arun
2011
3 p. 275-313
artikel
19 Continuation-Based Multiprocessing Mitchell Wand
1999
3 p. 285-299
15 p.
artikel
20 Continuation-Based Multiprocessing Wand, Mitchell
1999
3 p. 285-299
artikel
21 Continuation-Based Multiprocessing Revisited Mitchell Wand
1999
3 p. 283-283
1 p.
artikel
22 Continuation-Based Multiprocessing Revisited Wand, Mitchell
1999
3 p. 283
artikel
23 Continuation-Passing C, compiling threads to events through continuations Kerneis, Gabriel
2012
3 p. 239-279
artikel
24 Editorial Gallagher, John P.
2011
3 p. 273-274
artikel
25 Editorial Danvy, Olivier
2008
3 p. 237-238
artikel
26 Editorial Olivier Danvy
2000
3 p. 159-160
2 p.
artikel
27 Editorial Olivier Danvy
1999
3 p. 219-219
1 p.
artikel
28 Editorial David Basin
2003
3 p. 159-159
1 p.
artikel
29 Editorial David Basin
2004
3 p. 171-171
1 p.
artikel
30 Editorial Danvy, Olivier
2007
3 p. 197-198
artikel
31 Editorial Danvy, Olivier
2010
3 p. 197
artikel
32 Editorial Basin, David
2003
3 p. 159
artikel
33 Editorial Basin, David
2004
3 p. 171
artikel
34 Editorial Danvy, Olivier
1999
3 p. 219
artikel
35 Editorial Danvy, Olivier
2000
3 p. 159-160
artikel
36 Flattening tuples in an SSA intermediate representation Ziarek, Lukasz
2008
3 p. 333-358
artikel
37 Formal Foundations of Operational Semantics Jonathan Ford
2003
3 p. 161-202
42 p.
artikel
38 Formal Foundations of Operational Semantics Ford, Jonathan
2003
3 p. 161-202
artikel
39 Generic multiset programming with discrimination-based joins and symbolic Cartesian products Henglein, Fritz
2011
3 p. 337-370
artikel
40 Growing a Language Guy L. Steele Jr.
1999
3 p. 221-236
16 p.
artikel
41 Growing a Language Steele, Guy L.
1999
3 p. 221-236
artikel
42 Higher-Order UnCurrying John Hannan
2000
3 p. 179-216
38 p.
artikel
43 Higher-Order UnCurrying Hannan, John
2000
3 p. 179-216
artikel
44 Implementing Coloured Petri Nets Using a Functional Programming Language Lars Michael Kristensen
2004
3 p. 207-243
37 p.
artikel
45 Implementing Coloured Petri Nets Using a Functional Programming Language Kristensen, Lars Michael
2004
3 p. 207-243
artikel
46 Linear-Time Self-Interpretation of the Pure Lambda Calculus Torben Æ. Mogensen
2000
3 p. 217-237
21 p.
artikel
47 Linear-Time Self-Interpretation of the Pure Lambda Calculus Mogensen, Torben Æ.
2000
3 p. 217-237
artikel
48 Making “stricterness” more relevant Holdermans, Stefan
2011
3 p. 315-335
artikel
49 Mnemonics: type-safe bytecode generation at run time Rudolph, Johannes
2011
3 p. 371-407
artikel
50 On the correctness of the Krivine machine Wand, Mitchell
2007
3 p. 231-235
artikel
51 On the implementation of automatic differentiation tools Bischof, Christian H.
2008
3 p. 311-331
artikel
52 On typing delimited continuations: three new solutions to the printf problem Asai, Kenichi
2009
3 p. 275-291
artikel
53 Optimal Representations of Polymorphic Types with Subtyping Alexander Aiken
1999
3 p. 237-282
46 p.
artikel
54 Optimal Representations of Polymorphic Types with Subtyping Aiken, Alexander
1999
3 p. 237-282
artikel
55 Path resolution for nested recursive modules Garrigue, Jacques
2012
3 p. 207-237
artikel
56 State-transition machines, revisited Schmidt, David A.
2007
3 p. 333-335
artikel
57 Static and Dynamic Program Compilation by Interpreter Specialization Scott Thibault
2000
3 p. 161-178
18 p.
artikel
58 Static and Dynamic Program Compilation by Interpreter Specialization Thibault, Scott
2000
3 p. 161-178
artikel
59 Strong Normalization from Weak Normalization by Translation into the Lambda-I-Calculus Inge Li Gørtz
2003
3 p. 253-285
33 p.
artikel
60 Strong Normalization from Weak Normalization by Translation into the Lambda-I-Calculus Gørtz, Inge Li
2003
3 p. 253-285
artikel
61 The graphical Krivine machine Lippi, Sylvain
2007
3 p. 295-318
artikel
62 Types and trace effects for object orientation Skalka, Christian
2008
3 p. 239-282
artikel
                             62 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland