Abstract is missing.
- Closure Conversion, Flat Environments, and the Complexity of Abstract MachinesBeniamino Accattoli, Cláudio Belo Lourenço, Dan R. Ghica, Giulio Guerrieri, Claudio Sacerdoti Coen. [doi]
- Realisability and Complementability of Multiparty Session TypesCinzia Di Giusto, Étienne Lozes, Pascal Urso. [doi]
- Formalizing Languages with Binding Operators in Rewriting LogicMaribel Fernández, José Meseguer 0001. [doi]
- An adequate while-language for stochastic hybrid computationRenato Neves, José Proença, Juliana Souza. [doi]
- Abstract machines and small-step semantics: a winning ticket for proof automation?Alain Delaët, Sandrine Blazy, Denis Merigoux. [doi]
- On the Automated Verification of BGP ConvergenceGerald Whitters, Haoyun Qin, Boon Thau Loo, Carolyn L. Talcott. [doi]
- Shallowly Embedded FunctionsBenedikt M. Rips, Niek Janssen, Mart Lubbers, Pieter W. M. Koopman. [doi]
- Determinism Types for Functional Logic ProgrammingMichael Hanus, Kai-Oliver Prott. [doi]
- Fixture Layout Optimization in Wood Industry: A Case StudyAnna Vitali, Roberto Amadini, Maurizio Gabbrielli. [doi]
- Operational Game Semantics for Generative Algebraic Effects and HandlersHamza Jaafar, Guilhem Jaber. [doi]
- Folding Narrowing for the Analysis of Mutual Exclusion ProtocolsRaúl López-Rueda, Duong Dinh Tran, Canh Minh Do, Santiago Escobar 0001, Kazuhiro Ogata 0001. [doi]
- A Reflection on Task-Oriented ProgrammingMart Lubbers, Tim Steenvoorden. [doi]
- An interactive type checker for dependent types with general recursion (System Description)Valentin Pasquale, Álvaro García-Pérez. [doi]
- Transporting Theorems about Typeability in LF Across Schematically Defined ContextsChase Johnson, Gopalan Nadathur. [doi]
- Recovering Commutation of Logically Constrained Rewriting and Equivalence TransformationsKanta Takahata, Jonas Schöpf, Naoki Nishida 0001, Takahito Aoto 0001. [doi]
- Mechanized Type Soundness for Substructural Types using IrisRobbert Krebbers. [doi]
- Distributed, Coordination-Free Programming: 10 Years of Progress Since LaspChristopher Meiklejohn, Peter Van Roy. [doi]
- Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term RewritingJan-Christoph Kassing, Leon Valentin Spitzer, Jürgen Giesl. [doi]
- Counting Qubits and Gates: Resource Analysis in Quantum Programming LanguagesUgo Dal Lago. [doi]
- Formalizing Weighted Pushdown Systems in Isabelle/HOLAnders Schlichtkrull, Morten Konggaard Schou. [doi]