Abstract is missing.
- Simulating Cities: A Software Engineering PerspectiveCristina V. Lopes. 1-14 [doi]
- Regular Programming for Quantitative Properties of Data StreamsRajeev Alur, Dana Fisman, Mukund Raghothaman. 15-40 [doi]
- Formalizing Single-Assignment Program Verification: An Adaptation-Complete ApproachCláudio Belo Lourenço, Maria João Frade, Jorge Sousa Pinto. 41-67 [doi]
- Practical Optional Types for ClojureAmbrose Bonnaire-Sergeant, Rowan Davies, Sam Tobin-Hochstadt. 68-94 [doi]
- A Timed Process Algebra for Wireless Networks with an Application in Routing - (Extended Abstract)Emile Bres, Rob J. van Glabbeek, Peter Höfner. 95-122 [doi]
- Computing with Semirings and Weak Rig GroupoidsJacques Carette, Amr Sabry. 123-148 [doi]
- On Hierarchical Communication Topologies in the \pi -calculusEmanuele D'Osualdo, C.-H. Luke Ong. 149-175 [doi]
- Modular Termination Verification for Non-blocking ConcurrencyPedro da Rocha Pinto, Thomas Dinsdale-Young, Philippa Gardner, Julian Sutherland. 176-201 [doi]
- Call-By-Push-Value from a Linear Logic Point of ViewThomas Ehrhard. 202-228 [doi]
- Visible Type ApplicationRichard A. Eisenberg, Stephanie Weirich, Hamidhasan G. Ahmed. 229-254 [doi]
- Automatically Splitting a Two-Stage Lambda CalculusNicolas Feltman, Carlo Angiuli, Umut A. Acar, Kayvon Fatahalian. 255-281 [doi]
- Probabilistic NetKATNate Foster, Dexter Kozen, Konstantinos Mamouras, Mark Reitblatt, Alexandra Silva 0001. 282-309 [doi]
- Coordinated Concurrent Programming in SyndicateTony Garnock-Jones, Matthias Felleisen. 310-336 [doi]
- An Application of Computable Distributions to the Semantics of Probabilistic Programming LanguagesDaniel Huang, Greg Morrisett. 337-363 [doi]
- Weakest Precondition Reasoning for Expected Run-Times of Probabilistic ProgramsBenjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo. 364-389 [doi]
- Improving Floating-Point Numbers: A Lazy Approach to Adaptive Accuracy Refinement for Numerical ComputationsHideyuki Kawabata, Hideya Iwasaki. 390-418 [doi]
- Needle & Knot: Binder Boilerplate Tied UpSteven Keuchel, Stephanie Weirich, Tom Schrijvers. 419-445 [doi]
- On the Relative Expressiveness of Higher-Order Session ProcessesDimitrios Kouzapas, Jorge A. Pérez, Nobuko Yoshida. 446-475 [doi]
- A Classical Realizability Model for a Semantical Value RestrictionRodolphe Lepigre. 476-502 [doi]
- Probabilistic Functions and Cryptographic Oracles in Higher Order LogicAndreas Lochbihler. 503-531 [doi]
- Extensible and Efficient Automation Through Reflective TacticsGregory Malecha, Jesper Bengtson. 532-559 [doi]
- An Algorithm Inspired by Constraint Solvers to Infer Inductive Invariants in Numeric ProgramsAntoine Miné, Jason Breck, Thomas W. Reps. 560-588 [doi]
- Functional Big-Step SemanticsScott Owens, Magnus O. Myreen, Ramana Kumar, Yong Kiam Tan. 589-615 [doi]
- Classical By-NeedPierre-Marie Pédrot, Alexis Saurin. 616-643 [doi]
- Macrofication: Refactoring by Reverse Macro ExpansionChristopher Schuster, Tim Disney, Cormac Flanagan. 644-671 [doi]
- Type Error Diagnosis for Embedded DSLs by Two-Stage Specialized Type RulesAlejandro Serrano, Jurriaan Hage. 672-698 [doi]
- Actor Services - Modular Verification of Message Passing ProgramsAlexander J. Summers, Peter Müller 0001. 699-726 [doi]
- Transfinite Step-Indexing: Decoupling Concrete and Logical StepsKasper Svendsen, Filip Sieczkowski, Lars Birkedal. 727-751 [doi]
- A Higher-Order Abstract Syntax Approach to Verified Transformations on Functional ProgramsYuTing Wang, Gopalan Nadathur. 752-779 [doi]
- The Expressive Power of Monotonic Parallel CompositionJohannes Åman Pohjola, Joachim Parrow. 780-803 [doi]