Abstract is missing.
- Exploiting Unique Fixed PointsRalf Hinze. 1 [doi]
- Scrap Your Type ApplicationsBarry Jay, Simon L. Peyton Jones. 2-27 [doi]
- Programming with Effects in CoqGreg Morrisett. 28 [doi]
- Verifying a Semantic beta-eta-Conversion Test for Martin-Löf Type TheoryAndreas Abel, Thierry Coquand, Peter Dybjer. 29-56 [doi]
- The Capacity-CTorch ProblemRoland Carl Backhouse. 57-78 [doi]
- Recounting the Rationals: Twice!Roland Carl Backhouse, João F. Ferreira. 79-91 [doi]
- Zippy Tabulations of Recursive FunctionsRichard S. Bird. 92-109 [doi]
- Unfolding Abstract DatatypesJeremy Gibbons. 110-133 [doi]
- Circulations, Fuzzy Relations and SemiringsRoland Glück, Bernhard Möller. 134-152 [doi]
- Asynchronous Exceptions as an EffectWilliam L. Harrison, Gerard Allwein, Andy Gill, Adam Procter. 153-176 [doi]
- The Böhm-Jacopini Theorem Is False, PropositionallyDexter Kozen, Wei-Lung Dustin Tseng. 177-192 [doi]
- The Expression LemmaRalf Lämmel, Ondrej Rypacek. 193-219 [doi]
- Nested Datatypes with Generalized Mendler Iteration: Map Fusion and the Example of the Representation of Untyped Lambda Calculus with Explicit FlatteningRalph Matthes. 220-242 [doi]
- Probabilistic Choice in Refinement AlgebraLarissa Meinicke, Ian J. Hayes. 243-267 [doi]
- Algebra of Programming Using Dependent TypesShin-Cheng Mu, Hsiang-Shang Ko, Patrik Jansson. 268-283 [doi]
- Safe Modification of Pointer Programs in Refinement CalculusSusumu Nishimura. 284-304 [doi]
- A Hoare Logic for Call-by-Value Functional ProgramsYann Régis-Gianas, François Pottier. 305-335 [doi]
- Synthesis of Optimal Control Policies for Some Infinite-State Transition SystemsMichel Sintzoff. 336-359 [doi]
- Modal Semirings RevisitedJules Desharnais, Georg Struth. 360-387 [doi]
- Asymptotic Improvement of Computations over Free MonadsJanis Voigtländer. 388-403 [doi]
- Symmetric and Synchronous Communication in Peer-to-Peer NetworksAndreas Witzel. 404-421 [doi]