Program Development by Proof Transformation
暂无分享,去创建一个
[1] Ulrich Berger,et al. Program Extraction from Normalization Proofs , 2006, Stud Logica.
[2] Chetan R. Murthy. Extracting Constructive Content From Classical Proofs , 1990 .
[3] A. Troelstra,et al. Constructivism in Mathematics: An Introduction , 1988 .
[4] Harvey M. Friedman,et al. Classically and intuitionistically provably recursive functions , 1978 .
[5] Seif Haridi,et al. An Intuitionistic Predicate Logic Theorem Prover , 1989, J. Log. Comput..
[6] Roy Dyckhoff,et al. Contraction-free sequent calculi for intuitionistic logic , 1992, Journal of Symbolic Logic.
[7] T. Nipkom. Functional unification of higher-order patterns , 1993, LICS 1993.
[8] C. Goad. Computational uses of the manipulation of formal proofs , 1980 .
[9] H. Weyl,et al. Über die neue Grundlagenkrise der Mathematik , 1921 .
[10] Martin Stein. Interpretationen der Heyting-Arithmetik endlicher Typen , 1978, Arch. Math. Log..
[11] G. Gentzen. Untersuchungen über das logische Schließen. I , 1935 .
[12] Richard Scheines,et al. Searching for Proofs (in Sentential Logic) , 1990 .
[13] H. Schwichtenberg. Proofs as programs , 1993 .
[14] Jiirg Hudelmaier,et al. Bounds for cut elimination in intuitionistic propositional logic , 1992, Arch. Math. Log..
[15] Dale Miller,et al. A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification , 1991, J. Log. Comput..