<--- Back to Details
First PageDocument Content
Logic in computer science / Formal methods / Automated theorem proving / Proof assistant / Type theory / POPLmark challenge / Twelf / HOL / Matita / Theoretical computer science / Mathematical software / Mathematical logic
Date: 2010-08-30 07:17:32
Logic in computer science
Formal methods
Automated theorem proving
Proof assistant
Type theory
POPLmark challenge
Twelf
HOL
Matita
Theoretical computer science
Mathematical software
Mathematical logic

Add to Reading List

Source URL: www.cs.ru.nl

Download Document from Source Website

File Size: 638,48 KB

Share Document on Facebook

Similar Documents

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

Microsoft PowerPoint - SASyLF-wmm08-web.ppt

DocID: 1pTp0 - View Document

Programming language theory / Formal methods / POPLmark challenge / Mathematical proof / Programming language semantics / Logic in computer science / Proof theory

Proof assistants in computer science research Xavier Leroy Inria Paris-Rocquencourt Semantics of proofs and certified mathematics,

DocID: 1pI3l - View Document

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

Stephanie Weirich School of Engineering and Science, University of Pennsylvania Levine 510, 3330 Walnut St, Philadelphia, PA 19104  •  • October 10, 2014 Education

DocID: 13D7e - View Document

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

Stephanie Weirich Research Statement My research focuses on the design of statically-typed programming languages. Static type systems are a popular, cost-effective form of lightweight program verification. They provide

DocID: 13A2Y - View Document

Formal methods / Automated theorem proving / Logic in computer science / POPLmark challenge / Programming language theory / Formal sciences / QED manifesto / Nqthm / Theoretical computer science / Mathematics / Logic

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

DocID: 11wzl - View Document