| 2012 | A Lambda Calculus for Gdel-Dummett Logic Capturing Waitfreedom. | Yoichi Hirai |
| 2012 | Correct Looping Arrows from Cyclic Terms - Traced Categorical Interpretation in Haskell. | Makoto Hamana |
| 2012 | A General Implementation Framework for Tabled CLP. | Pablo Chico de Guzmn, Manuel Carro, Manuel V. Hermenegildo, Peter J. Stuckey |
| 2012 | Programming with Boolean Satisfaction. | Michael Codish |
| 2012 | Improving the Performance of FD Constraint Solving in a CFLP System. | Ignacio Castieiras, Fernando Senz-Prez |
| 2012 | Declarative Debugging of Wrong and Missing Answers for SQL Views. | Rafael Caballero, Yolanda Garca-Ruiz, Fernando Senz-Prez |
| 2012 | Real-Time Persistent Queues and Deques with Logic Variables (Declarative Pearl). | Gerlof Bouma |
| 2012 | Normal Form Bisimulations for Delimited-Control Operators. | Dariusz Biernacki, Sergue Lenglet |
| 2012 | Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts. | Zena M. Ariola, Paul Downen, Hugo Herbelin, Keiko Nakata, Alexis Saurin |
| 2012 | Compiling a Functional Logic Language: The Basic Scheme. | Sergio Antoy, Arthur Michener Peters |
| 2012 | Call-by-Value Solvability, Revisited. | Beniamino Accattoli, Luca Paolini |
| 2010 | Tag-Free Combinators for Binding-Time Polymorphic Program Generation. | Peter Thiemann, Martin Sulzmann |
| 2010 | Solving Constraint Satisfaction Problems with SAT Technology. | Naoyuki Tamura, Tomoya Tanjo, Mutsunori Banbara |
| 2010 | Automatically Generating Counterexamples to Naive Free Theorems. | Daniel Seidel, Janis Voigtlnder |
| 2010 | Standardization and Bhm Trees for Lambda | Alexis Saurin |
| 2010 | Using Static Analysis to Detect Type Errors and Concurrency Defects in Erlang Programs. | Konstantinos Sagonas |
| 2010 | A Church-Style Intermediate Language for ML | Didier Rmy, Boris Yakobowski |
| 2010 | Beluga: Programming with Dependent Types, Contextual Data, and Contexts. | Brigitte Pientka |
| 2010 | Haskell Type Constraints Unleashed. | Dominic A. Orchard, Tom Schrijvers |
| 2010 | Proving Injectivity of Functions via Program Inversion in Term Rewriting. | Naoki Nishida, Masahiko Sakai |
| 2010 | Automatic Parallelization of Recursive Functions Using Quantifier Elimination. | Akimasa Morihata, Kiminori Matsuzaki |
| 2010 | Delimited Control in OCaml, Abstractly and Concretely: System Description. | Oleg Kiselyov |
| 2010 | Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and | Jeroen Ketema, Jakob Grue Simonsen |
| 2010 | A Pearl on SAT Solving in Prolog. | Jacob M. Howe, Andy King |
| 2010 | Code Generation via Higher-Order Rewrite Systems. | Florian Haftmann, Tobias Nipkow |