Travelled to:1 × Brazil
1 × Finland
1 × Hungary
1 × Portugal
1 × United Kingdom
2 × USA
3 × Japan
Collaborated with:∅ P.Baillot M.Basaldella A.Ciabattoni D.Mazza L.Straßburger N.Galatos V.Atassi
Talks about:logic (5) type (5) calculus (3) complet (3) light (3) affin (3) comput (2) proof (2) rule (2) infinitari (1)
Person: Kazushige Terui
DBLP: Terui:Kazushige
Contributed to:
2015
2012
2010
2009
2009200820062005200420012018Wrote 12 papers:
- ICALP-v2-2015-MazzaT
- Parsimonious Types and Non-uniform Computation (DM, KT), pp. 350–361.
- RTA-2012-Terui #complexity #evaluation #semantics #λ-calculus
- Semantic Evaluation, Intersection Types and Complexity of Simply Typed λ Calculus (KT), pp. 323–338.
- LICS-2010-BasaldellaT
- Infinitary Completeness in Ludics (MB, KT), pp. 294–303.
- CSL-2009-CiabattoniST #proving
- Expanding the Realm of Systematic Proof Theory (AC, LS, KT), pp. 163–178.
- TLCA-2009-BasaldellaT #logic #on the
- On the Meaning of Logical Completeness (MB, KT), pp. 50–64.
- LICS-2008-CiabattoniGT #axiom #logic
- From Axioms to Analytic Rules in Nonclassical Logics (AC, NG, KT), pp. 229–240.
- CSL-2006-AtassiBT #logic #system f #verification
- Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic (VA, PB, KT), pp. 150–166.
- TLCA-2005-BaillotT #algorithm #logic #type system
- A Feasible Algorithm for Typing in Elementary Affine Logic (PB, KT), pp. 55–70.
- LICS-2004-BaillotT #polynomial #λ-calculus
- Light Types for Polynomial Time Computation in λ-Calculus (PB, KT), pp. 266–275.
- LICS-2004-Terui #proving
- Proof Nets and Boolean Circuits (KT), pp. 182–191.
- LICS-2001-Terui #calculus #normalisation
- Light Affine Calculus and Polytime Strong Normalization (KT), pp. 209–220.
- CSL-2018-Terui #higher-order #logic
- MacNeille Completion and Buchholz' Omega Rule for Parameter-Free Second Order Logics (KT), p. 19.