A Formalized Proof of Strong Normalization for Guarded Recursive Types Andreas Abel and Andrea Vezzosi Computer Science and Engineering, Chalmers and Gothenburg University, Rännvägen 6, 41296 Göteborg, Sweden andreas. - Proof calculus - Document - PDFSEARCH.IO

First Page	Meta Content
	A Formalized Proof of Strong Normalization for Guarded Recursive Types Andreas Abel and Andrea Vezzosi Computer Science and Engineering, Chalmers and Gothenburg University, Rännvägen 6, 41296 Göteborg, Sweden andreas. Add to Reading List Document Date: 2014-08-29 19:03:11 Open Document File Size: 240,60 KB Share Result on Facebook Company Y combinator / / / Facility Gothenburg University / / IndustryTerm possible solutions / / Organization Engineering / Chalmers and Gothenburg University / / Person Agda / Martin-Löf Type Theory / Andrea Vezzosi / Ty / Abel / / Position first author / proof assistant / guard / / ProgrammingLanguage Haskell / / Technology functional programming / / SocialTag Dependently typed programming Logic in computer science Type theory Proof theory Curry–Howard correspondence Philosophy of computer science Symbol Lambda calculus Intuitionistic type theory Theoretical computer science

A Formalized Proof of Strong Normalization for Guarded Recursive Types Andreas Abel and Andrea Vezzosi Computer Science and Engineering, Chalmers and Gothenburg University, Rännvägen 6, 41296 Göteborg, Sweden andreas.Add to Reading List