Abstract is missing.
- Logic/Constraint Programming and Concurrency: The Hard-Won Lessons of the Fifth Generation Computer ProjectKazunori Ueda. 1-11 [doi]
- From Sets to Bits in CoqArthur Blot, Pierre-Évariste Dagand, Julia Lawall. 12-28 [doi]
- From Proposition to Program - Embedding the Refinement Calculus in CoqWouter Swierstra, Joao Alpuim. 29-44 [doi]
- The Boolean Constraint Solver of SWI-Prolog (System Description)Markus Triska. 45-61 [doi]
- Probabilistic Inference by Program Transformation in Hakaru (System Description)Praveen Narayanan, Jacques Carette, Wren Romano, Chung-chieh Shan, Robert Zinkov. 62-79 [doi]
- T - Declarative PearlIan Mackie, Shinya Sato. 80-93 [doi]
- Space-Efficient Planar Acyclicity Constraints - A Declarative PearlTaus Brock-Nannestad. 94-108 [doi]
- Executable Relational Specifications of Polymorphic Type Systems Using PrologKi Yung Ahn, Andrea Vezzosi. 109-125 [doi]
- Proof Relevant Corecursive ResolutionPeng Fu 0001, Ekaterina Komendantskaya, Tom Schrijvers, Andrew Pond. 126-143 [doi]
- A Coq Library for Internal Verification of Running-TimesJay A. McCarthy, Burke Fetscher, Max S. New, Daniel Feltey, Robby Findler. 144-162 [doi]
- A Transformational Approach to Parametric Accumulated-Cost Static ProfilingRémy Haemmerlé, Pedro López-García 0001, Umer Liqat, Maximiliano Klemen, John P. Gallagher, Manuel V. Hermenegildo. 163-180 [doi]
- Polymorphic Types in Erlang Function SpecificationsFrancisco Javier López-Fraguas, Manuel Montenegro, Juan Rodríguez-Hortalá. 181-197 [doi]
- Declarative Foreign Function Binding Through Generic ProgrammingJeremy Yallop, David Sheets, Anil Madhavapeddy. 198-214 [doi]
- Incremental Computing with Abstract Data StructuresAkimasa Morihata. 215-231 [doi]
- Declarative Programming with AlgebraAndré van Delft, Anatoliy Kmetyuk. 232-251 [doi]