论文信息 - Logic, Language, Information and Computation

Logic, Language, Information and Computation

We discuss the formalization, in the Matita Theorem Prover, of a few, basic results on Turing Machines, up to the existence of a (certified) Universal Machine. The work is meant to be a preliminary step towards the creation of a formal repository in Complexity Theory, and is a small piece in our Reverse Complexity program, aiming to a comfortable, machine independent axiomatization of the field.

[1] Radha Jagadeesan,et al. Full Abstraction for PCF , 1994, Inf. Comput..

[2] André Hirschowitz,et al. The algebraicity of the lambda-calculus , 2007, ArXiv.

[3] Maribel Fernández,et al. Nominal rewriting , 2007, Inf. Comput..

[4] Christoph Lüth,et al. Rewriting Via Coinserters , 2003, Nord. J. Comput..

[5] Benedikt Ahrens. Initiality for Typed Syntax and Semantics , 2012, WoLLIC.

[6] André Hirschowitz,et al. Modules over Monads and Linearity , 2006, WoLLIC.

[7] Benedikt Ahrens,et al. Extended Initiality for Typed Abstract Syntax , 2011, Log. Methods Comput. Sci..

[8] André Hirschowitz,et al. Modules over monads and initial semantics , 2010, Inf. Comput..

[9] Chung-Kil Hur. Categorical equational systems : algebraic models and equational reasoning , 2010 .

[10] Chung-Kil Hur,et al. Equational Systems and Free Constructions (Extended Abstract) , 2007, ICALP.