Equational reasoning about programs with general recursion and call-by-value semantics

Garrin Kimmell, Aaron Stump, Harley D. Eades, Peng Fu, Tim Sheard, Stephanie Weirich, Chris Casinghino, Vilhelm Sjöberg, Nathan Collins, Ki Yung Ahn

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


Dependently typed programming languages provide a mechanism for integrating verification and programming by encoding invariants as types. Traditionally, dependently typed languages have been based on constructive type theories, where the connection between proofs and programs is based on the Curry-Howard correspondence. This connection comes at a price, however, as it is necessary for the languages to be normalizing to preserve logical soundness. Trellys is a call-by-value dependently typed programming language currently in development that is designed to integrate a type theory with unsound programming features, such as general recursion, Type:Type, and arbitrary data types. In this paper we outline one core language design for Trellys, and demonstrate the use of the key language constructs to facilitate sound reasoning about potentially diverging programs.

Original languageEnglish (US)
Pages (from-to)19-46
Number of pages28
JournalProgress in Informatics
Issue number10
StatePublished - Mar 2013
Externally publishedYes


  • Design
  • Languages
  • Theory
  • Verification

ASJC Scopus subject areas

  • Computer Science(all)
  • Library and Information Sciences


Dive into the research topics of 'Equational reasoning about programs with general recursion and call-by-value semantics'. Together they form a unique fingerprint.

Cite this