- 1:S panning set of connections Sch olarpedia
- Revue d' intelligence arti cielle, 4(3):53{79, November 1990 Towards a formal Theory
- Formal Reasoning about Modules, Reuse and their Correctness ?
- Under consideration for publication in J. Functional Programming 1 Building Reliable, High-Performance Networks
- The Representation of Program Synthesis in Higher Order Logic Christoph Kreitz
- Minimal and Complete Pre x Uni cation for Non-Classical Theorem Proving
- Requirements implementation
- Converting Non-Classical Matrix Proofs into Sequent-Style Systems
- Steps Toward a World Wide Digital Library of Formal Algorithmic Knowledge 1
- Towards a flexible LOPS implementation An example of XPRTS programming
- The Nuprl Open Logical Environment S. F. Allen, R. L. Constable, R. Eaton, C. Kreitz, and L. Lorigo
- Proving Hybrid Protocols Correct Mark Bickford, Christoph Kreitz, Robbert van Renesse, Xiaoming Liu
- The Representation of Program Synthesis in Higher Order Logic Christoph Kreitz
- C U R R I C U L U M V I T A E Christoph Maximilian Sebastian K R E I T Z
- Figure 1: Spanning set of connections Connection method
- interactive interactive
- MetaPRL | A Modular Logical Environment ? Jason Hickey 1 , Aleksey Nogin 1 , Robert L. Constable 2 , Brian E. Aydemir 1 , Eli
- Formally Verifying Hybrid Protocols with the Nuprl Logical Programming Environment
- Abstract--Horus Ensemble efforts culminated multiyear Cornell research program
- Formale Methoden der Kunstlichen Intelligenz Christoph Kreitz
- A Matrix Characterization For Multiplicative Exponential Linear Logic
- Under consideration for publication in J. Functional Programming 1 Building Reliable, High-Performance Networks
- MetaPRL A Modular Logical Environment Jason Hickey1
- System Description: A Nuprl-PVS Connection
- User-specified Adaptive Scheduling in a Streaming Media Michael Hicks, Robbert van Renesse,
- Formally Verifying Hybrid Protocols with the Nuprl Logical Programming Environment
- Abstract The Horus and Ensemble efforts culminated a multi-year Cornell research program in process group
- Automated Fast-Track Reconfiguration of Group Communication Systems
- A Type-based Framework for Automatic Debugging
- A Multi-Level Approach to Program Synthesis S. Schmitt1
- Formal Reasoning about Communication Systems I
- Deciding Intuitionistic Propositional Logic via Translation into Classical Logic
- A Uniform Proof Procedure for Classical and Non-Classical Logics
- Problem-Oriented Applications of Automated Theorem Proving
- Logical Foundations for Declarative Object-oriented Programming
- A Foundation for Verified Software Development Systems
- Building Proofs by Analogy via the Curry-Howard Isomorphism
- zy i rat2 h&s with y on th t tapecan already
- Revue d' intelligence artificielle, 4(3):5379, November 1990 Towards a formal Theory
- Theoretical Computer Science 38 (1985) 35-53 North-Holland
- Guiding Program Development Systems by a Connection Based Proof Strategy
- User-speci ed Adaptive Scheduling in a Streaming Media Michael Hicks, Robbert van Renesse,
- CURR I CULUM V I TAE Christoph Maximilian Sebastian KRE I TZ
- Deciding Intuitionistic Propositional Logic via Translation into Classical Logic
- A Multi-Level Approach to Program Synthesis W. Bibel 1 D. Korn 1 C. Kreitz 2 F. Kurucz 1 J. Otten 2 S. Schmitt 1 G. Stolpmann 1
- Logical Foundations for Declarative Object-oriented Programming ?
- Integrating a Connection Based Proof Method into an Interactive Program Development System
- Converting Non-Classical Matrix Proofs into Sequent-Style Systems
- I n the beginning was the Con-nection Method, and the Con-
- Introduction The development
- A Matrix Characterization For Multiplicative Exponential Linear Logic
- A Type-based Framework for Automatic Debugging
- A Foundation for Veri ed Software Development Systems
- Annals of Pure and Applied Logic 35 (1987) 247-260 North-Holland
- Instantiation of Existentially Quantified Variables in Inductive Specification Proofs
- Automated Fast-Track Recon guration of Group Communication Systems
- A Uniform Proof Procedure for Classical and Non-Classical Logics
- Integrating a Connection Based Proof Method into an Interactive Program Development System
- CHRISTOPH KREITZ PROGRAM SYNTHESIS
- Innovations in Computational Type Theory using Nuprl
- LOGIC ORIENTED PROGRAM SYNTHESIS goals and realization
- Presentation opportunity
- Protocol Switching: Exploiting Meta-Properties Xiaoming Liu, Robbert van Renesse, Mark Bickford
- Steps Toward a World Wide Digital Library of Formal Algorithmic Knowledge 1
- Connection-Based Proof Construction in Linear Logic
- Minimal and Complete Prefix Unification for Non-Classical Theorem Proving
- Formale Methoden der K unstlichen Intelligenz Christoph Kreitz
- identifier. occurrences
- The ILTP Problem Library for Intuitionistic Logic Release v1.1
- intuitionistic applications
- Protocol Switching: Exploiting MetaProperties Xiaoming Liu, Robbert van Renesse, Mark Bickford
- Problem-Oriented Applications of Automated Theorem Proving
- Deriving Strategies for the Design of Global Search Algorithms
- The ILTP Problem Library for Intuitionistic Logic Release v1.1
- Annals of Pure and Applied Logic 36 (1987) 29-38 North-HoUand
- The Nuprl Open Logical Environment S. F. Allen, R. L. Constable, R. Eaton, C. Kreitz, and L. Lorigo ?
- Deriving Strategies for the Design of Global Search Algorithms
- Building Proofs by Analogy via the Curry-Howard Isomorphism ?
- Dead Code Elimination Through Type Inference Ozan Hafizo~gullari Christoph Kreitz
- Introduction interpreter
- Connection-Based Proof Construction in Linear Logic
- Innovations in Computational Type Theory using Nuprl
- Guiding Program Development Systems by a Connection Based Proof Strategy
- CHRISTOPH KREITZ PROGRAM SYNTHESIS
- I n the beginning The Scienti created the Intellectics and the
- Interactive Development
- Formal Mathematics for Veri ably Correct Program Synthesis
- Formal Reasoning about Modules, Reuse and their Correctness
- Towards a exible LOPS implementation An example of XPRTS programming
- Formal Reasoning about Communication Systems I
- Formal Mathematics for Verifiably Correct Program Synthesis
- generalpurpose, datastructure
- PRL A Proof Refinement Calculus for Classical Reasoning
- COMPLEXITY THEORY ON REAL NUMBERS AND FUNCTIONS by Christoph Kreitz and Klaus Weihrauch
- Specifying and Verifying Organizational Security Properties in First-Order Logic
- #PRL --A Proof Refinement Calculus for Classical Reasoning
