Turning Inductive into Equational Specifications
暂无分享,去创建一个
Stefan Berghofer | Lukas Bulwahn | Florian Haftmann | Stefan Berghofer | Florian Haftmann | Lukas Bulwahn
[1] David Aspinall,et al. Formalising Java's Data Race Free Guarantee , 2007, TPHOLs.
[2] Maribel Fernández,et al. Curry-Style Types for Nominal Terms , 2006, TYPES.
[3] Richard J. Lipton,et al. Foundations of Secure Computation , 1978 .
[4] Lawrence Charles Paulson,et al. Isabelle/HOL: A Proof Assistant for Higher-Order Logic , 2002 .
[5] David von Oheimb,et al. Mujava: embedding a programming language in a theorem prover , 1999 .
[6] Konrad Slind. Reasoning about terminating functional programs , 1999 .
[7] Michael Hanus,et al. A unified computation model for functional and logic programming , 1997, POPL '97.
[8] Tobias Nipkow,et al. A Code Generator Framework for Isabelle / HOL , 2007 .
[9] Tobias Nipkow,et al. An operational semantics and type safety prooffor multiple inheritance in C++ , 2006, OOPSLA '06.
[10] Tobias Nipkow,et al. Executing Higher Order Logic , 2000, TYPES.
[11] David Delahaye,et al. Extracting Purely Functional Contents from Logical Inductive Types , 2007, TPHOLs.
[12] Ludovic Henrio,et al. A Mechanized Model of the Theory of Objects , 2007, FMOODS.
[13] Michael O. Rabin,et al. In Foundations of secure computation , 1978 .