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
39
click to vote
AAIP
2009
favorite
Email
discuss
report
251
views
Programming Languages
»
more
AAIP 2009
»
Enumerating Well-Typed Terms Generically
13 years 9 months ago
Download
www.cogsys.wiai.uni-bamberg.de
We use generic programming techniques to generate well-typed lambda terms. We encode well-typed terms by generalized algebraic datatypes (GADTs) and existential types. The Spine approach (Hinze et al. 2006; Hinze and L
Alexey Rodriguez Yakushev, Johan Jeuring
Real-time Traffic
AAIP 2009
|
Generic Programming
|
Generic Programming Techniques
|
Programming Languages
|
Spine Approach
|
claim paper
Related Content
»
Prime clauses for fast enumeration of satisfying assignments to boolean circuits
more »
Post Info
More Details (n/a)
Added
08 Nov 2010
Updated
08 Nov 2010
Type
Conference
Year
2009
Where
AAIP
Authors
Alexey Rodriguez Yakushev, Johan Jeuring
Comments
(0)
Researcher Info
Programming Languages Study Group
Computer Vision