BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Brazil
1 × Italy
1 × Japan
1 × Norway
1 × Portugal
1 × Spain
1 × USA
2 × Poland
2 × United Kingdom
3 × France
Collaborated with:
F.Lamarche N.Guenot A.Guglielmi A.Das S.Hetzl M.Acclavio K.Chaudhuri T.Gundersen A.Ciabattoni K.Terui S.Mehner D.Seidel J.Voigtländer
Talks about:
logic (9) proof (6) proposit (3) classic (3) linear (3) intuitionist (2) structur (2) calculus (2) theorem (2) multipl (2)

Person: Lutz Straßburger

DBLP DBLP: Stra=szlig=burger:Lutz

Contributed to:

RTA 20152015
CSL-LICS 20142014
PPDP 20142014
FOSSACS 20132013
CSL 20122012
CSL 20112011
LICS 20102010
CSL 20092009
LATA 20092009
TLCA 20092009
RTA 20072007
LICS 20052005
TLCA 20052005
CSL 20042004
CSL 20012001
IJCAR 20182018

Wrote 16 papers:

RTA-2015-DasS #linear #logic #term rewriting
No complete linear term rewriting system for propositional logic (AD, LS), pp. 127–142.
LICS-CSL-2014-GuenotS #logic #normalisation #symmetry
Symmetric normalisation for intuitionistic logic (NG, LS), p. 10.
PPDP-2014-MehnerSSV #functional #parametricity #proving #theorem
Parametricity and Proving Free Theorems for Functional-Logic Languages (SM, DS, LS, JV), pp. 19–30.
FoSSaCS-2013-Strassburger #logic
Cut Elimination in Nested Sequents for Intuitionistic Modal Logics (LS), pp. 209–224.
CSL-2012-HetzlS #first-order #logic
Herbrand-Confluence for Cut Elimination in Classical First Order Logic (SH, LS), pp. 320–334.
CSL-2011-ChaudhuriGS #calculus
The Focused Calculus of Structures (KC, NG, LS), pp. 159–173.
LICS-2010-GuglielmiGS #logic
Breaking Paths in Atomic Flows for Classical Logic (AG, TG, LS), pp. 284–293.
CSL-2009-CiabattoniST #proving
Expanding the Realm of Systematic Proof Theory (AC, LS, KT), pp. 163–178.
LATA-2009-Strassburger #theorem
A Kleene Theorem for Forest Languages (LS), pp. 715–727.
TLCA-2009-Strassburger #higher-order #linear #logic #multi #proving
Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic (LS), pp. 309–324.
A Characterization of Medial as Rewriting Rule (LS), pp. 344–358.
LICS-2005-LamarcheS #category theory
Constructing Free Boolean Categories (FL, LS), pp. 209–218.
TLCA-2005-LamarcheS #logic #proving
Naming Proofs in Classical Propositional Logic (FL, LS), pp. 246–261.
CSL-2004-StrassburgerL #linear #logic #multi #on the #proving
On Proof Nets for Multiplicative Linear Logic with Units (LS, FL), pp. 145–159.
CSL-2001-GuglielmiS #calculus #commutative
Non-commutativity and MELL in the Calculus of Structures (AG, LS), pp. 54–68.
IJCAR-2018-AcclavioS #combinator #proving
From Syntactic Proofs to Combinatorial Proofs (MA, LS), pp. 481–497.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.