POPLmark challenge - PDFSEARCH.IO - Document Search Engine

POPLmark challenge
Results: 11

#	Item
1	Microsoft PowerPoint - SASyLF-wmm08-web.ppt Add to Reading List Source URL: www.cis.upenn.edu Language: English - Date: 2008-10-15 15:02:54 Theoretical computer science Mathematics Type theory Mathematical logic Formal methods Logic in computer science Programming language theory Twelf POPLmark challenge Lambda calculus Theorem Formal language
2	Proof assistants in computer science research Xavier Leroy Inria Paris-Rocquencourt Semantics of proofs and certified mathematics, Add to Reading List Source URL: pauillac.inria.fr Language: English - Date: 2015-09-15 04:31:52 Programming language theory Formal methods POPLmark challenge Mathematical proof Programming language semantics Logic in computer science Proof theory
3	Stephanie Weirich School of Engineering and Science, University of Pennsylvania Levine 510, 3330 Walnut St, Philadelphia, PA 19104  •  • October 10, 2014 Education Add to Reading List Source URL: www.cis.upenn.edu Language: English - Date: 2014-10-10 11:35:35 Type theory Functional programming Logic in computer science Dependently typed programming Data types International Conference on Functional Programming Dependent type ICFP Programming Contest POPLmark challenge Software engineering Computing Programming language theory
4	Stephanie Weirich Research Statement My research focuses on the design of statically-typed programming languages. Static type systems are a popular, cost-eﬀective form of lightweight program veriﬁcation. They provide Add to Reading List Source URL: www.cis.upenn.edu Language: English - Date: 2014-08-01 09:01:37 Type theory Functional programming Data types Functional languages International Conference on Functional Programming POPLmark challenge Principles of Programming Languages SIGPLAN Haskell Software engineering Computing Programming language theory
5	It is Time to Mechanize Programming Language Metatheory? Benjamin C. Pierce1 , Peter Sewell2 , Stephanie Weirich1 , and Steve Zdancewic1 1 Department of Computer and Information Science, University of Pennsylvania Add to Reading List Source URL: vstte.ethz.ch Language: English - Date: 2005-10-11 03:37:08 Formal methods Automated theorem proving Logic in computer science POPLmark challenge Programming language theory Formal sciences QED manifesto Nqthm Theoretical computer science Mathematics Logic
6	LFMTP[removed]A List-machine Benchmark for Mechanized Metatheory (Extended Abstract) Andrew W. Appel Princeton University and INRIA Rocquencourt Add to Reading List Source URL: gallium.inria.fr Language: English - Date: 2006-07-19 04:40:31 Logic in computer science Type theory Deduction Automated theorem proving Formal methods Twelf Symbol Proof assistant POPLmark challenge Logic Theoretical computer science Mathematical logic
7	Curriculum Vitae Peter Michael Sewell October 25, 2014 Personal Details Name: Add to Reading List Source URL: www.cl.cam.ac.uk Language: English - Date: 2014-10-25 15:04:53 Software engineering Principles of Programming Languages International Conference on Functional Programming ACM SIGACT Programming Language Design and Implementation SIGPLAN POPLmark challenge Theoretical computer science International Colloquium on Automata Languages and Programming Computer science Computing Association for Computing Machinery
8	Mechanized Metatheory for the Masses: The PoplMark Challenge Brian E. Aydemir1 , Aaron Bohannon1 , Matthew Fairbairn2 , J. Nathan Foster1 , Benjamin C. Pierce1 , Peter Sewell2 , Dimitrios Vytiniotis1 , Geoffrey Washburn1 Add to Reading List Source URL: www.cl.cam.ac.uk Language: English - Date: 2005-11-30 06:37:29 Mathematics Formal methods Deduction Proof theory Data types POPLmark challenge Subtype polymorphism Twelf Type safety Type theory Logic Theoretical computer science
9	Ott: Effective Tool Support for the Working Semanticist Peter Sewell∗ Francesco Zappa Nardelli† Thomas Ridge∗ Add to Reading List Source URL: www.cl.cam.ac.uk Language: English - Date: 2007-10-18 09:46:53 Lambda calculus Formal methods Type theory Logic in computer science Programming language theory Twelf POPLmark challenge OCaml Proof assistant Software engineering Computing Theoretical computer science
10	The Matita Interactive Theorem Prover Andrea Asperti1 , Wilmer Ricciotti1 , Claudio Sacerdoti Coen1 , and Enrico Tassi2 1 Department of Computer Science, University of Bologna Add to Reading List Source URL: matita.cs.unibo.it Language: English - Date: 2012-02-14 06:55:31 Formal methods Automated theorem proving Logic in computer science Type theory Programming language theory Matita Proof assistant POPLmark challenge Theorem Proving in Higher-Order Logics Theoretical computer science Computer science Applied mathematics

UPDATE