Equational Reasoning about Programs with General Recursion and Call-by-value Semantics Garrin Kimmell Aaron Stump - Curry–Howard correspondence - Document - PDFSEARCH.IO

First Page	Meta Content
	Equational Reasoning about Programs with General Recursion and Call-by-value Semantics Garrin Kimmell Aaron Stump Add to Reading List Document Date: 2014-07-10 05:47:16 Open Document File Size: 240,15 KB Share Result on Facebook City Philadelphia / / Country United States / / Currency USD / / / Facility Peng Fu Tim Sheard Stephanie Weirich University / Chris Casinghino Vilhelm Sj¨oberg Nathan Collins University of Pennsylvania / Eades III University / / IndustryTerm dependent products / dependent type systems / internal verification solution / program analysis algorithm / prior theorem proving systems / search operator / language processing tools / / Organization Portland State University / University of Iowa / University of Pennsylvania / / Person Nat / Yung Ahn / Tim Sheard Stephanie / Chris Casinghino Vilhelm Sj / Aaron Stump Harley / / Position representative / Language Constructs General / General / evaluator / programmer / / ProgrammingLanguage C / / Technology Functional Programming / program analysis algorithm / / URL http / SocialTag Logic in computer science Mathematical logic Type theory Dependently typed programming Higher-order functions Append Curry–Howard correspondence Curry Structural induction Software engineering

Equational Reasoning about Programs with General Recursion and Call-by-value Semantics Garrin Kimmell Aaron StumpAdd to Reading List