Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Patrick Baillot - MaRDI portal

Patrick Baillot

From MaRDI portal
Person:276252

Available identifiers

zbMath Open baillot.patrickMaRDI QIDQ276252

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61761192023-08-21Paper
https://portal.mardi4nfdi.de/entity/Q50797302022-05-28Paper
Types for complexity of parallel computation in pi-calculus2021-10-18Paper
Combining linear logic and size types for implicit complexity2020-04-21Paper
Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs2019-10-25Paper
Characterizing polynomial and exponential complexity classes in elementary lambda-calculus2018-06-14Paper
https://portal.mardi4nfdi.de/entity/Q52784292017-07-19Paper
Higher-order interpretations and program complexity2016-05-03Paper
Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs2016-01-12Paper
On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy2015-05-04Paper
Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus2014-09-15Paper
Higher-Order Interpretations and Program Complexity2012-11-22Paper
On quasi-interpretations, blind abstractions and implicit complexity2012-09-06Paper
Light logics and optimal reduction: completeness and complexity2011-02-21Paper
A PolyTime Functional Language from Light Linear Logic2010-05-04Paper
Linear logic by levels and bounded time complexity2009-12-15Paper
Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic2009-03-12Paper
From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing2009-03-10Paper
Light types for polynomial time computation in lambda calculus2009-03-02Paper
Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic2008-04-01Paper
Foundations of Software Science and Computation Structures2007-09-28Paper
On light logics, uniform encodings and polynomial time2006-08-28Paper
Typed Lambda Calculi and Applications2005-11-11Paper
Type inference for light affine logic via constraints on words2005-01-11Paper
Stratified coherence spaces: A denotational semantics for light linear logic2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q27083162001-11-23Paper
https://portal.mardi4nfdi.de/entity/Q42638592000-02-28Paper
https://portal.mardi4nfdi.de/entity/Q42189221999-03-18Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Patrick Baillot