Space-Efficient Latent Contracts

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

Standard higher-order contract monitoring breaks tail recursion and leads to space leaks that can change a program’s asymptotic complexity; space-efficiency restores tail recursion and bounds the amount of space used by contracts. Space-efficient contract monitoring for contracts enforcing simple type disciplines (a/k/a gradual typing) is well studied. Prior work establishes a space-efficient semantics for manifest contracts without dependency [10]; we adapt that work to a latent calculus with dependency. We guarantee space efficiency when no dependency is used; we cannot generally guarantee space efficiency when dependency is used, but instead offer a framework for making such programs space efficient on a case-by-case basis.

Original languageEnglish
Title of host publicationTrends in Functional Programming - 17th International Conference, TFP 2016, Revised Selected Papers
EditorsDavid Van Horn, John Hughes
Pages3-23
Number of pages21
DOIs
StatePublished - 2019
Event17th International Symposium on Trends in Functional Programming, TFP 2016 - College Park, United States
Duration: 8 Jun 201610 Jun 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10447 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference17th International Symposium on Trends in Functional Programming, TFP 2016
Country/TerritoryUnited States
CityCollege Park
Period8/06/1610/06/16

Fingerprint

Dive into the research topics of 'Space-Efficient Latent Contracts'. Together they form a unique fingerprint.

Cite this