Clicky

Rewriting in Cambridge LCF by Lawrence C. Paulson and similar books you'll love - Bookscovery

Home > Authors > Lawrence C. Paulson > Rewriting in Cambridge LCF

Buy at: Bookshop.org Amazon

Rewriting in Cambridge LCF

Lawrence C. Paulson

Recent activity

Rate this book to see your activity here.

18 Books Similar to Rewriting in Cambridge LCF by Lawrence C. Paulson

Bookscovery readers who liked Rewriting in Cambridge LCF also like Constructing recursions operators in intuitionistic type theory, Interactive theorem proving with Cambridge LCF and Isabelle. How many of these have you read?

Constructing recursions operators in intuitionistic type theory by Lawrence C. Paulson

Cover of Constructing recursions operators in intuitionistic type theory
Buy this book at:
Bookshop.org Amazon

Interactive theorem proving with Cambridge LCF by Lawrence C. Paulson

Cover of Interactive theorem proving with Cambridge LCF
Buy this book at:
Bookshop.org Amazon

Isabelle by Lawrence C. Paulson

Cover of Isabelle
Buy this book at:
Bookshop.org Amazon

Isabelle/HOL by Tobias Nipkow

Cover of Isabelle/HOL
Buy this book at:
Bookshop.org Amazon

Lessons learned from LCF by Lawrence C. Paulson

Cover of Lessons learned from LCF
Buy this book at:
Bookshop.org Amazon

Logic and computation by Lawrence C. Paulson

Cover of Logic and computation
Buy this book at:
Bookshop.org Amazon

Logic and Computation by Lawrence C. Paulson

Cover of Logic and Computation
Buy this book at:
Bookshop.org Amazon

Mechanized proofs of security protocols by Lawrence C. Paulson

Cover of Mechanized proofs of security protocols
Buy this book at:
Bookshop.org Amazon

ML for the working programmer by Lawrence C. Paulson

Cover of ML for the working programmer
Buy this book at:
Bookshop.org Amazon

Natural deduction proof as higher-order resolution by Lawrence C. Paulson

Cover of Natural deduction proof as higher-order resolution
Buy this book at:
Bookshop.org Amazon

Natural deduction theorem proving via higher-order resolution by Lawrence C. Paulson

Cover of Natural deduction theorem proving via higher-order resolution
Buy this book at:
Bookshop.org Amazon

Proving termination of normalization functions for conditional expressions by Lawrence C. Paulson

Cover of Proving termination of normalization functions for conditional expressions
Buy this book at:
Bookshop.org Amazon

Recent developments in LCF by Lawrence C. Paulson

Cover of Recent developments in LCF
Buy this book at:
Bookshop.org Amazon

Tactics and tacticals in Cambridge LCF by Lawrence C. Paulson

Cover of Tactics and tacticals in Cambridge LCF
Buy this book at:
Bookshop.org Amazon

The foundation of a generic theorem prover by Lawrence C. Paulson

Cover of The foundation of a generic theorem prover
Buy this book at:
Bookshop.org Amazon

The representation of logics in higher-order logic by Lawrence C. Paulson

Cover of The representation of logics in higher-order logic
Buy this book at:
Bookshop.org Amazon

The revised logic PPLamda a reference manual by Lawrence C. Paulson

Cover of The revised logic PPLamda a reference manual
Buy this book at:
Bookshop.org Amazon

Verifying the unification algorithm in LCF by Lawrence C. Paulson

Cover of Verifying the unification algorithm in LCF
Buy this book at:
Bookshop.org Amazon

Comments and reviews of Rewriting in Cambridge LCF

Please sign in to leave a comment