Abstract is missing.
- A declarative and bidirectional model transformation approach based on graph co-spansYngve Lamo, Florian Mantz, Adrian Rutle, Juan de Lara. 1-12 [doi]
- Coq: the world's best macro assembler?Andrew Kennedy, Nick Benton, Jonas Braband Jensen, Pierre-Évariste Dagand. 13-24 [doi]
- An operational foundation for the tactic language of CoqWojciech Jedynak, Malgorzata Biernacka, Dariusz Biernacki. 25-36 [doi]
- Proofs you can believe in: proving equivalences between Prolog semantics in CoqJael Kriener, Andy King, Sandrine Blazy. 37-48 [doi]
- A semantics for weakly encapsulated search in functional logic programsJan Christiansen, Michael Hanus, Fabian Reck, Daniel Seidel. 49-60 [doi]
- needed redexes really needed?Sergio Antoy, Andy Jost. 61-71 [doi]
- A parameterized graph transformation calculus for finite graphs with monadic branchesKazuyuki Asada, Soichiro Hidaka, Hiroyuki Kato, Zhenjiang Hu, Keisuke Nakano. 73-84 [doi]
- Deriving the full-reducing Krivine machine from the small-step operational semantics of normal orderÁlvaro García-Pérez, Pablo Nogueira, Juan José Moreno-Navarro. 85-96 [doi]
- A synthetic operational account of call-by-need evaluationOlivier Danvy, Ian Zerny. 97-108 [doi]
- A logical correspondence between natural semantics and abstract machinesRobert J. Simmons, Ian Zerny. 109-119 [doi]
- Engineering definitional interpretersJan Midtgaard, Norman Ramsey, Bradford Larsen. 121-132 [doi]
- Extensible sparse functional arrays with circuit parallelismJohn T. O'Donnell. 133-144 [doi]
- Dependent types for enforcement of information flow and erasure policies in heterogeneous data structuresGordon Stewart, Anindya Banerjee, Aleksandar Nanevski. 145-156 [doi]
- Reasoning about higher-order relational specificationsYuTing Wang, Kaustuv Chaudhuri, Andrew Gacek, Gopalan Nadathur. 157-168 [doi]
- Time refinement in a functional synchronous languageLouis Mandel, Cédric Pasteur, Marc Pouzet. 169-180 [doi]
- Unifying the Knuth-Bendix, recursive path and polynomial ordersAkihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe. 181-192 [doi]
- Theory propagation and rational-treesEd Robbins, Jacob M. Howe, Andy King. 193-204 [doi]
- Decentralized execution of constraint handling rules for ensemblesEdmund S. L. Lam, Iliano Cervesato. 205-216 [doi]
- Finite type extensions in constraint programmingRafael Caballero, Peter J. Stuckey, Antonio Tenorio-Fornes. 217-227 [doi]
- Eventual linear ranking functionsRoberto Bagnara, Fred Mesnard. 229-238 [doi]
- Detecting decidable classes of finitely ground logic programs with function symbolsMarco Calautti, Sergio Greco, Irina Trubitsyna. 239-250 [doi]
- Shape analysis in a functional language by using regular languagesManuel Montenegro, Ricardo Peña, Clara Segura. 251-262 [doi]
- Efficient computation of program equivalence for confluent concurrent constraint programmingLuis Fernando Pino, Filippo Bonchi, Frank D. Valencia. 263-274 [doi]
- Random testing of purely functional abstract datatypes: guidelines for dealing with operation invarianceStefan Holdermans. 275-284 [doi]
- Prolog programming with a map-reduce parallel constructJoana Côrte-Real, Inês de Castro Dutra, Ricardo Rocha. 285-296 [doi]
- Bidirectionalization for free with runtime recording: or, a light-weight approach to the view-update problemKazutaka Matsuda, Meng Wang. 297-308 [doi]