First Page | Document Content | |
---|---|---|
Date: 2007-07-02 08:10:34Type theory Theoretical computer science Mathematical logic Programming language theory Lambda calculus Formal methods Logic in computer science CurryHoward correspondence HindleyMilner type system Simply typed lambda calculus Type system Proof assistant | PML : A new proof assistant and deduction system Christophe Raffalli LAMAAdd to Reading ListSource URL: www.lama.univ-savoie.frDownload Document from Source WebsiteFile Size: 534,07 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 |