Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Handbook of theoretical computer science (vol. B)
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Computation and reasoning: a type theory for computer science
Computation and reasoning: a type theory for computer science
Theoretical Computer Science - Domains
Verifying Properties of Module Construction in Type Theory
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Synthetic Domain Theory in Type Theory: Another Logic of Computable Functions
TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
General synthetic domain theory – a logical approach
Mathematical Structures in Computer Science
A uniform approach to domain theory in realizability models
Mathematical Structures in Computer Science
Some Domain Theory and Denotational Semantics in Coq
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
| Hi-index | 0.00 |
Four statements equivalent to well-foundedness (well-founded induction, existence of recursively defined functions, uniqueness of recursively defined functions, and absence of descending ω-chains) have been proved in Mizar and the proofs mechanically ...