Full Reduction in the Face of Absurdity
No abstract available.
Related papers
- Full Reduction at Full Throttle CPP 2011
- The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus JFP 2019
- Symmetry Reduction for the Local Mu-Calculus TACAS 2018
- LEAN: simplifying concurrency bug reproduction via replay-supported execution reduction OOPSLA 2012
- A Confluent Reduction for the lambda-Calculus with Surjective Pairing and Terminal Object JFP 1996
- Bounded partial-order reduction OOPSLA 2013
- Partial-Order Reduction for Parity Games with an Application on Parameterised Boolean Equation Systems TACAS 2020
- Empty Types in Polymorphic Lambda Calculus POPL 1987