English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  Complete and Easy Bidirectional Typechecking for Higher-rank Polymorphism

Dunfield, J., & Krishnaswami, N. (2013). Complete and Easy Bidirectional Typechecking for Higher-rank Polymorphism. In ICFP'13 (pp. 429-442). New York, NY: ACM. doi:10.1145/2500365.2500582.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0027-F73F-0 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0027-F77B-A
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Dunfield, Joshua1, 2, 3, Author           
Krishnaswami, Neelakantan1, Author           
Affiliations:
1Group D. Dreyer, Max Planck Institute for Software Systems, Max Planck Society, ou_2105286              
2Group U. Acar, Max Planck Institute for Software Systems, Max Planck Society, ou_2105294              
3Group R. Majumdar, Max Planck Institute for Software Systems, Max Planck Society, ou_2105292              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20132013
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Internal
 Identifiers: eDoc: 692234
DOI: 10.1145/2500365.2500582
 Degree: -

Event

show
hide
Title: ACM SIGPLAN International Conference on Functional Programming
Place of Event: Boston, MA, USA
Start-/End Date: 2013-09-25 - 2013-09-27

Legal Case

show

Project information

show

Source 1

show
hide
Title: ICFP'13
  Subtitle : Proceedings of the 2013 ACM SIGPLAN International Conference on Functional Programming
  Abbreviation : ICFP 2013
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, NY : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 429 - 442 Identifier: ISBN: 978-1-4503-2326-0