First Page | Document Content | |
---|---|---|
Date: 2013-05-10 10:01:51Software engineering Computer programming Computing Proof assistants Logic in computer science Functional languages Automated theorem proving Theoretical computer science HOL Logic for Computable Functions Automated reasoning ML | Steps Towards Verified Implementations of HOL Light Magnus O. Myreen1 , Scott Owens2 , and Ramana Kumar1 1 Computer Laboratory, University of Cambridge, UKAdd to Reading ListSource URL: cakeml.orgDownload Document from Source WebsiteFile Size: 171,83 KBShare Document on Facebook |
Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of viewDocID: 1xVR3 - View Document | |
Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗DocID: 1xUAX - View Document | |
Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcsDocID: 1xUr4 - View Document | |
Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingenDocID: 1xTuz - View Document | |
CS 153 Current Topics in Theoretical Computer Science Spring 2016DocID: 1vryF - View Document |