Programming Languages and Systems

Simulating Cities: A Software Engineering Perspective.-Regular Programming for Quantitative Properties of Data Streams.- FormalizingSingle-assignment Program Verification: an Adaptationcomplete Approach.- PracticalOptional Types for Clojure.- A Timed Process Algebra for Wireless Networks withan Application in Routing.- Computing with semirings and weak rig groupoids.- OnHierarchical Communication Topologies in the pi-calculus.- Modular TerminationVerification for Non-blocking Concurrency.- Call-by-Push-Value from a LinearLogic point of view.- Visible Type Application.- Automatically Splitting aTwo-Stage Lambda Calculus.- Probabilistic NetKAT.-Coordinated ConcurrentProgramming in Syndicate.- An application of computable distributions to thesemantics of probabilistic programming languages.- Weakest PreconditionReasoning for Expected Run-Times of Probabilistic Programs.- ImprovingFloating-Point Numbers: a Lazy Approach to Adaptive Accuracy Refinement forNumerical Computations.- Needle & Knot: Binder boilerplate tied up.- On theRelative Expressiveness of Higher-Order Session Processes.- A RealizabilityModel for a Semantical Value Restriction.- Probabilistic functions andcryptographic oracles in higher order logic.- Extensible and EfficientAutomation through Reflective Tactics.- An Algorithm Inspired by ConstraintSolvers to Infer Inductive Invariants in Numeric Programs.- Functional Big-stepSemantics.- Classical by-need.- Macrofication: Refactoring by Reverse MacroExpansion.- Type Error Diagnosis for Embedded DSLs by Two-Stage Specialized TypeRules.- Actor Services: Modular Verification of Message Passing Programs.- TransfiniteStep-indexing: Decoupling Concrete and Logical Steps.- A Higher-Order AbstractSyntax Approach to Verified Transformations on Functional Programs.- TheExpressive Power of Monotonic Parallel Composition.