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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
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
89
Voted
AMAST
1991
Springer
87
views
Software Engineering
»
more
AMAST 1991
»
Extracting Recursive Programs in Type Theory
15 years 6 months ago
Download
www.cs.jhu.edu
Scott F. Smith
Real-time Traffic
AMAST 1991
|
Software Engineering
|
claim paper
Related Content
»
Recursion on Nested Datatypes in Dependent Type Theory
»
Inductive Coinductive and Pointed Types
»
An Operational Domaintheoretic Treatment of Recursive Types
»
Type inference principal typings and letpolymorphism for firstclass mixin modules
»
A type system for recursive modules
»
Pattern minimization problems over recursive data types
»
Relational parametricity for references and recursive types
»
Embedding a logical theory of constructions in Agda
»
StepIndexed Syntactic Logical Relations for Recursive and Quantified Types
more »
Post Info
More Details (n/a)
Added
27 Aug 2010
Updated
27 Aug 2010
Type
Conference
Year
1991
Where
AMAST
Authors
Scott F. Smith
Comments
(0)
Researcher Info
Software Engineering Study Group
Computer Vision