Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
33
click to vote
TLCA
2009
Springer
favorite
Email
discuss
report
129
views
Theoretical Computer Science
»
more
TLCA 2009
»
Refinement Types as Proof Irrelevance
14 years 3 months ago
Download
www.cs.cmu.edu
William Lovas, Frank Pfenning
Real-time Traffic
TLCA 2009
|
claim paper
Related Content
»
Refinement Types for Logical Frameworks and Their Interpretation as Proof Irrelevance
»
A Modular Typechecking algorithm for Type Theory with Singleton Types and Proof Irrelevanc...
»
On the Strength of ProofIrrelevant Type Theories
»
Coloured Petri net refinement specification and correctness proof with Coq
»
ProofCarrying Code in a SessionTyped Process Calculus
»
A Bidirectional Refinement Type System for LF
»
Combining Type Theory and Untyped Set Theory
»
A challenge for atomicity verification
»
A BiDirectional Refinement Algorithm for the Calculus of CoInductive Constructions
more »
Post Info
More Details (n/a)
Added
27 Jul 2010
Updated
27 Jul 2010
Type
Conference
Year
2009
Where
TLCA
Authors
William Lovas, Frank Pfenning
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision