The following pages link to LCF (Q20369):
Displaying 50 items.
- The promotion and accumulation strategies in transformational programming (Q3330483) (← links)
- (Q3340118) (← links)
- A reflective functional language for hardware design and theorem proving (Q3377460) (← links)
- (Q3484381) (← links)
- (Q3499245) (← links)
- Some Considerations on the Usability of Interactive Provers (Q3582703) (← links)
- A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL (Q3613430) (← links)
- (Q3685162) (← links)
- (Q3735065) (← links)
- (Q3749213) (← links)
- (Q3753930) (← links)
- (Q3766816) (← links)
- An ideal model for recursive polymorphic types (Q3776602) (← links)
- Étude et implémentation d'un système de déduction pour logique algorithmique (Q3802671) (← links)
- (Q3804239) (← links)
- (Q3815296) (← links)
- (Q3893285) (← links)
- (Q4012173) (← links)
- (Q4023900) (← links)
- (Q4058139) (← links)
- (Q4107890) (← links)
- (Q4122847) (← links)
- (Q4127365) (← links)
- Lucid—A Formal System for Writing and Proving Programs (Q4136511) (← links)
- (Q4138713) (← links)
- (Q4156412) (← links)
- (Q4167599) (← links)
- (Q4223591) (← links)
- Transparent optimisation of rewriting combinators (Q4267719) (← links)
- (Q4281465) (← links)
- Automated proofs of object code for a widely used microprocessor (Q4371519) (← links)
- Inductive methods for proving properties of programs (Q4404415) (← links)
- (Q4499163) (← links)
- Internal analogy in theorem proving (Q4647502) (← links)
- Structuring metatheory on inductive definitions (Q4647512) (← links)
- Reflection of formal tactics in a deductive reflection framework (Q4647552) (← links)
- (Q4766019) (← links)
- (Q4790648) (← links)
- Programming Combinations of Deduction and BDD-based Symbolic Calculation (Q4827596) (← links)
- The Strategy Challenge in SMT Solving (Q4913859) (← links)
- Logical Analysis of Hybrid Systems (Q4930176) (← links)
- Recursive Programs as Definitions in First-Order Logic (Q5184385) (← links)
- Understanding and maintaining tactics graphically OR how we are learning that a diagram can be worth more than 10K LoC (Q5195279) (← links)
- Tactic theorem proving with refinement-tree proofs and metavariables (Q5210800) (← links)
- Reconstructing proofs at the assertion level (Q5210809) (← links)
- (Q5219926) (← links)
- A FORMAL PROOF OF THE KEPLER CONJECTURE (Q5280247) (← links)
- A comprehensible guide to a new unifier for CIC including universe polymorphism and overloading (Q5372007) (← links)
- (Q5674962) (← links)
- Operational interpretations of an extension of F<sub>ω</sub> with control operators (Q5687907) (← links)
