- Impossibility of distributed consensus with one faulty process Michael J. Fischer Nancy A. Lynch Michael S. Paterson Fri 02 March 2012
- On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs Michał Pilipczuk Marcin Wrochna Fri 02 March 2012
- Conditioning in Probabilistic Programming Federico Olmedo Friedrich Gretz Nils Jansen Benjamin Lucien Kaminski Joost-Pieter Katoen Annabelle Mciver Fri 02 March 2012
- Undecidability results for probabilistic automata Nathanaël Fijalkow Fri 02 March 2012
- String constraints with concatenation and transducers solved efficiently Lukáš Holík Petr Janků Anthony W. Lin Philipp Rümmer Tomáš Vojnar Fri 02 March 2012
- Linear Haskell: practical linearity in a higher-order polymorphic language Jean-Philippe Bernardy Mathieu Boespflug Ryan R. Newton Simon Peyton Jones Arnaud Spiwack Fri 02 March 2012
- Handling fibred algebraic effects Danel Ahman Fri 02 March 2012
- Foundations for natural proofs and quantifier instantiation Christof Löding P. Madhusudan Lucas Peña Fri 02 March 2012
- Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs Sheshansh Agrawal Krishnendu Chatterjee Petr Novotný Fri 02 March 2012
- Univalent higher categories via complete Semi-Segal types Paolo Capriotti Nicolai Kraus Fri 02 March 2012
- Generating good generators for inductive relations Leonidas Lampropoulos Zoe Paraskevopoulou Benjamin C. Pierce Fri 02 March 2012
- Synthesizing coupling proofs of differential privacy Aws Albarghouthi Justin Hsu Fri 02 March 2012
- Measurable cones and stable, measurable functions: a model for probabilistic higher-order programming Thomas Ehrhard Michele Pagani Christine Tasson Fri 02 March 2012
- Denotational validation of higher-order Bayesian inference Adam Ścibior Ohad Kammar Matthijs Vákár Sam Staton Hongseok Yang Yufei Cai Klaus Ostermann Sean K. Moss Chris Heunen Zoubin Ghahramani Fri 02 March 2012
- Strategy synthesis for linear arithmetic games Azadeh Farzan Zachary Kincaid Fri 02 March 2012
- A logical relation for monadic encapsulation of state: proving contextual equivalences in the presence of runST Amin Timany Léo Stefanesco Morten Krogh-Jespersen Lars Birkedal Fri 02 March 2012
- Ambiguity in context-free grammars Bruce S. N. Cheung Fri 02 March 2012
- Full Abstraction for Probabilistic PCF Thomas Ehrhard Michele Pagani Christine Tasson Fri 02 March 2012
- Mechanising and verifying the WebAssembly specification Conrad Watt Fri 02 March 2012
- Adapting proof automation to adapt proofs Talia Ringer Nathaniel Yazdani John Leo Dan Grossman Fri 02 March 2012
Library Size: 13G (12943 entries),
Last Updated: Apr 05, 2026, 21:58:59,
Build Time: N/A
