Zobrazeno 1 - 10
of 65
pro vyhledávání: '"Terui, Kazushige"'
Autor:
Terui, Kazushige
Buchholz' Omega-rule is a way to give a syntactic, possibly ordinal-free proof of cut elimination for various subsystems of second order arithmetic. Our goal is to understand it from an algebraic point of view. Among many proofs of cut elimination fo
Externí odkaz:
http://arxiv.org/abs/1804.11066
Autor:
Basaldella, Michele, Terui, Kazushige
Publikováno v:
Logical Methods in Computer Science, Volume 6, Issue 4 (December 22, 2010) lmcs:1066
Goedel's completeness theorem is concerned with provability, while Girard's theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proofs. Our purpose is to look for a connection between these two disciplines.
Externí odkaz:
http://arxiv.org/abs/1011.1625
Autor:
Brunel, Aloïs, Terui, Kazushige
Publikováno v:
EPTCS 23, 2010, pp. 31-46
We introduce a variant of linear logic with second order quantifiers and type fixpoints, both restricted to purely linear formulas. The Church encodings of binary words are typed by a standard non-linear type `Church,' while the Scott encodings (pure
Externí odkaz:
http://arxiv.org/abs/1005.0524
Publikováno v:
Logical Methods in Computer Science, Volume 3, Issue 4 (November 15, 2007) lmcs:1234
In a previous work Baillot and Terui introduced Dual light affine logic (DLAL) as a variant of Light linear logic suitable for guaranteeing complexity properties on lambda calculus terms: all typable terms can be evaluated in polynomial time by beta
Externí odkaz:
http://arxiv.org/abs/0710.1153
Publikováno v:
A para\^{i}tre dans Proceedings Computer Science Logic 2006 (CSL'06), LNCS, Springer. (2006)
In a previous work we introduced Dual Light Affine Logic (DLAL) ([BaillotTerui04]) as a variant of Light Linear Logic suitable for guaranteeing complexity properties on lambda-calculus terms: all typable terms can be evaluated in polynomial time and
Externí odkaz:
http://arxiv.org/abs/cs/0603104
Autor:
Baillot, Patrick, Terui, Kazushige
We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following previous references on this topic, the variant of EAL type system we co
Externí odkaz:
http://arxiv.org/abs/cs/0412028
Autor:
Baillot, Patrick, Terui, Kazushige
We propose a new type system for lambda-calculus ensuring that well-typed programs can be executed in polynomial time: Dual light affine logic (DLAL). DLAL has a simple type language with a linear and an intuitionistic type arrow, and one modality. I
Externí odkaz:
http://arxiv.org/abs/cs/0402059
Autor:
Okada, Mitsuhiro, Terui, Kazushige
Publikováno v:
The Journal of Symbolic Logic, 1999 Jun 01. 64(2), 790-802.
Externí odkaz:
https://www.jstor.org/stable/2586501
Publikováno v:
In Annals of Pure and Applied Logic 2012 163(3):266-290
Autor:
Terui, Kazushige
Publikováno v:
In Theoretical Computer Science 29 April 2011 412(20):2048-2071