Se ha publicado un art\u00edculo de razonamiento formalizado en Coq titulado [Combining proofs and programs in a dependently typed language](<\/p>\n
Sus autores son Chris Casinghino<\/a>, Vilhelm Sj\u00f6berg<\/a> y Stephanie Weirich<\/a> (de la Universidad de Pensilvania, EE.UU.).<\/p>\n Su resumen es<\/p>\n \n Most dependently-typed programming languages either require that all expressions terminate (e.g. Coq, Agda, and Epigram), or allow infinite loops but are inconsistent when viewed as logics (e.g. Haskell, ATS, \u03a9mega. Here, we combine these two approaches into a single dependently-typed core language. The language is composed of two fragments that share a common syntax and overlapping semantics: a logic that guarantees total correctness, and a call-by-value programming language that guarantees type safety but not termination. The two fragments may interact: logical expressions may be used as programs; the logic may soundly reason about potentially nonterminating programs; programs can require logical proofs as arguments; and “mobile” program values, including proofs computed at runtime, may be used as evidence by the logic. This language allows programmers to work with total and partial functions uniformly, providing a smooth path from functional programming to dependently-typed programming.<\/em>\n<\/p><\/blockquote>\n El trabajo se present\u00f3 en el POPL 2014<\/a> (41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages<\/em>).<\/p>\n