Abstract is missing.
- Beluga: Programming with Dependent Types, Contextual Data, and ContextsBrigitte Pientka. 1-12 [doi]
- Using Static Analysis to Detect Type Errors and Concurrency Defects in Erlang ProgramsKonstantinos F. Sagonas. 13-18 [doi]
- Solving Constraint Satisfaction Problems with SAT TechnologyNaoyuki Tamura, Tomoya Tanjo, Mutsunori Banbara. 19-23 [doi]
- A Church-Style Intermediate Language for ML:::F:::Didier Rémy, Boris Yakobowski. 24-39 [doi]
- PiSigma: Dependent Types without the SugarThorsten Altenkirch, Nils Anders Danielsson, Andres Löh, Nicolas Oury. 40-55 [doi]
- Haskell Type Constraints UnleashedDominic A. Orchard, Tom Schrijvers. 56-71 [doi]
- A Functional Framework for Result CheckingGilles Barthe, Pablo Buiras, César Kunz. 72-86 [doi]
- Tag-Free Combinators for Binding-Time Polymorphic Program GenerationPeter Thiemann, Martin Sulzmann. 87-102 [doi]
- Code Generation via Higher-Order Rewrite SystemsFlorian Haftmann, Tobias Nipkow. 103-117 [doi]
- A Complete Axiomatization of Strict EqualityJavier Álvez, Francisco Javier López-Fraguas. 118-133 [doi]
- Standardization and Böhm Trees for Lambda::::µ::::-CalculusAlexis Saurin. 134-149 [doi]
- An Integrated Distance for AtomsVicent Estruch, César Ferri, José Hernández-Orallo, M. José Ramírez-Quintana. 150-164 [doi]
- A Pearl on SAT Solving in PrologJacob M. Howe, Andy King. 165-174 [doi]
- Automatically Generating Counterexamples to Naive Free TheoremsDaniel Seidel, Janis Voigtländer. 175-190 [doi]
- Applying Constraint Logic Programming to SQL Test Case GenerationRafael Caballero, Yolanda García-Ruiz, Fernando Sáenz-Pérez. 191-206 [doi]
- Internal Normalization, Compilation and Decompilation for System ::::F::::::bh::Stefano Berardi, Makoto Tatsuta. 207-223 [doi]
- Towards Normalization by Evaluation for the ::::betaeta::::-Calculus of ConstructionsAndreas Abel. 224-239 [doi]
- Defunctionalized Interpreters for Call-by-Need EvaluationOlivier Danvy, Kevin Millikin, Johan Munk, Ian Zerny. 240-256 [doi]
- Complexity Analysis by Graph RewritingMartin Avanzini, Georg Moser. 257-271 [doi]
- Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and ::::lambda::::-CalculusJeroen Ketema, Jakob Grue Simonsen. 272-287 [doi]
- Proving Injectivity of Functions via Program Inversion in Term RewritingNaoki Nishida, Masahiko Sakai. 288-303 [doi]
- Delimited Control in OCaml, Abstractly and Concretely: System DescriptionOleg Kiselyov. 304-320 [doi]
- Automatic Parallelization of Recursive Functions Using Quantifier EliminationAkimasa Morihata, Kiminori Matsuzaki. 321-336 [doi]
- A Skeleton for Distributed Work Pools in EdenMischa Dieterle, Jost Berthold, Rita Loogen. 337-353 [doi]