Abstract is missing.
- Automatic verification of cryptographic protocols: a logic programming approachBruno Blanchet. 1-3 [doi]
- Towards a formal notion of trustMogens Nielsen, Karl Krukow. 4-7 [doi]
- A functional correspondence between evaluators and abstract machinesMads Sig Ager, Dariusz Biernacki, Olivier Danvy, Jan Midtgaard. 8-19 [doi]
- Conditional narrowing without conditionsSergio Antoy, Bernd Brassel, Michael Hanus. 20-31 [doi]
- Finding all minimal unsatisfiable subsetsMaria J. García de la Banda, Peter J. Stuckey, Jeremy Wazny. 32-43 [doi]
- On translating geometric solids to functional expressionsOmid Banyasad, Philip T. Cox. 44-55 [doi]
- ViMer: a visual debugger for mercuryM. Cameron, Maria J. García de la Banda, Kim Marriott, Peter Moulder. 56-66 [doi]
- Rank 2 intersection types for modulesFerruccio Damiani. 67-78 [doi]
- Extending arbitrary solvers with constraint handling rulesGregory J. Duck, Peter J. Stuckey, Maria J. García de la Banda, Christian Holzbaur. 79-90 [doi]
- Statically assuring secrecy for dynamic concurrent processesRachid Echahed, Frédéric Prost, Wendelin Serwe. 91-101 [doi]
- Formally deriving an STG machineAlberto de la Encina, Ricardo Pena. 102-112 [doi]
- Refining weakly outermost-needed rewriting and narrowingSantiago Escobar. 113-123 [doi]
- Simplification and termination of strategies in rule-based languagesOlivier Fissore, Isabelle Gnaedig, Hélène Kirchner. 124-135 [doi]
- On the rewriting and efficient computation of bound disjunctive datalog queriesSergio Greco, Ester Zumpano. 136-147 [doi]
- Term rewriting with variable binding: an initial algebra approachMakoto Hamana. 148-159 [doi]
- Compilation of extended recursion in call-by-value functional languagesTom Hirschowitz, Xavier Leroy, J. B. Wells. 160-171 [doi]
- From datalog rules to efficient programs with time and space guaranteesYanhong A. Liu, Scott D. Stoller. 172-183 [doi]
- A framework for typed HOAS and semanticsMarino Miculan, Ivan Scagnetto. 184-194 [doi]
- Explicit substitutions in the reduction of lambda termsGopalan Nadathur, Xiaochu Qi. 195-206 [doi]
- From dynamic binding to state via modal possibilityAleksandar Nanevski. 207-218 [doi]
- Integrating finite domain constraints and CLP with setsAlessandro Dal Palù, Agostino Dovier, Enrico Pontelli, Gianfranco Rossi. 219-229 [doi]
- Practical aspects of declarative debugging in Haskell 98Bernard Pope, Lee Naish. 230-240 [doi]
- Generativity and dynamic opacity for abstract typesAndreas Rossberg. 241-252 [doi]
- A demand-driven narrowing calculus with overlapping definitional treesRafael del Vado Vírseda. 253-263 [doi]
- Foundational proof checkers with small witnessesDinghao Wu, Andrew W. Appel, Aaron Stump. 264-274 [doi]
- Efficient fixpoint computation in linear tablingNeng-Fa Zhou, Taisuke Sato. 275-283 [doi]