Hostname: page-component-8448b6f56d-xtgtn Total loading time: 0 Render date: 2024-04-20T00:26:12.866Z Has data issue: false hasContentIssue false

Special issue on Programming with Dependent Types Editorial

Published online by Cambridge University Press:  08 June 2017

WOUTER SWIERSTRA
Affiliation:
Department of Information and Computing Science University of Utrecht, w.s.swierstra@uu.nl
PETER DYBJER
Affiliation:
Department of Computing Science and Engineering Chalmers University of Technology, peterd@chalmers.se
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

There has been sustained interest in functional programming languages with dependent types in recent years. The foundations of dependently typed programming can be traced back to Martin–Löf's work in the 1970s. In the past decades, this vision has given rise to the development of proof assistants and functional programming languages based on dependent types. The increased popularity of systems such as Agda, Coq, Idris, and many others, reflects the growing momentum in this research area. After sending out our first call for papers in October 2015, we are happy to accept six articles in this special issue covering a wide spectrum of topics.

Type
Articles
Copyright
Copyright © Cambridge University Press 2017 
Submit a response

Discussions

No Discussions have been published for this article.