Search results for "implicit computational complexity"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Arnold Beckmann	A Note on Universal Measures for Weak Implicit Computational Complexity.	LPAR	2002	DBLP DOI BibTeX RDF	Dynamic ordinals, Witness oracle TURING machines, Weak implicit computational complexity, Bounded arithmetic
3	Emanuele Covino, Giovanni Pani, Salvatore Caporaso	Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes.	CIAC	2000	DBLP DOI BibTeX RDF	time-space classes, elementary functions, implicit computational complexity
2	Roberto M. Amadio	Max-Plus Quasi-interpretations.	TLCA	2003	DBLP DOI BibTeX RDF	Functional languages and term rewriting, Function algebras and implicit computational complexity, Polynomial interpretations and max-plus algebras, Static analysis
2	Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan Terwijn	Linear Ramified Higher Type Recursion and Parallel Complexity.	Proof Theory in Computer Science	2001	DBLP DOI BibTeX RDF	higher types, parallel computation, recursion, linear logic, lambda calculus, implicit computational complexity, NC
1	Jean-Yves Marion (eds.)	Proceedings Second Workshop on Developments in Implicit Computational Complexity	DICE	2011	DBLP DOI BibTeX RDF
1	Clément Aubert	Sublogarithmic uniform Boolean proof nets	DICE	2011	DBLP DOI BibTeX RDF
1	Lucien Capedevielle	A type system for PSPACE derived from light linear logic	DICE	2011	DBLP DOI BibTeX RDF
1	Daniel Leivant, Ramyaa Ramyaa	Implicit complexity for coinductive data: a characterization of corecurrence	DICE	2011	DBLP DOI BibTeX RDF
1	Evgeny Makarov	Provably Total Functions of Arithmetic with Basic Terms	DICE	2011	DBLP DOI BibTeX RDF
1	Ugo Dal Lago, Andrea Masini, Margherita Zorzi	Quantum implicit computational complexity.	Theor. Comput. Sci.	2010	DBLP DOI BibTeX RDF
1	Patrick Baillot (eds.)	Proceedings International Workshop on Developments in Implicit Computational complExity	DICE	2010	DBLP DOI BibTeX RDF
1	Aloïs Brunel, Kazushige Terui	Church => Scott = Ptime: an application of resource sensitive realizability	DICE	2010	DBLP DOI BibTeX RDF
1	Luca Roversi, Luca Vercelli	Safe Recursion on Notation into a Light Logic by Levels	DICE	2010	DBLP DOI BibTeX RDF
1	Guillaume Bonfante	Observation of implicit complexity by non confluence	DICE	2010	DBLP DOI BibTeX RDF
1	Amir M. Ben-Amram	On Decidable Growth-Rate Properties of Imperative Programs	DICE	2010	DBLP DOI BibTeX RDF
1	Ugo Dal Lago, Simone Martini, Margherita Zorzi	General Ramified Recurrence is Sound for Polynomial Time	DICE	2010	DBLP DOI BibTeX RDF
1	Patrick Baillot, Jean-Yves Marion, Simona Ronchi Della Rocca	Guest editorial: Special issue on implicit computational complexity.	ACM Trans. Comput. Log.	2009	DBLP DOI BibTeX RDF
1	Toshiyasu Arai, Naohi Eguchi	A new function algebra of EXPTIME functions by safe nested recursion.	ACM Trans. Comput. Log.	2009	DBLP DOI BibTeX RDF	EXPTIME, Implicit computational complexity
1	Neil D. Jones, Lars Kristiansen	A flow calculus of mwp-bounds for complexity analysis.	ACM Trans. Comput. Log.	2009	DBLP DOI BibTeX RDF	automatable complexity analysis of imperative programs, static program anaysis, Implicit computational complexity
1	Ugo Dal Lago	Context semantics, linear logic, and computational complexity.	ACM Trans. Comput. Log.	2009	DBLP DOI BibTeX RDF	linear logic, implicit computational complexity, Geometry of interaction
1	Ugo Dal Lago	The geometry of linear higher-order recursion.	ACM Trans. Comput. Log.	2009	DBLP DOI BibTeX RDF	higher-order recursion, type systems, lambda calculus, implicit computational complexity, Geometry of interaction
1	Jean-Yves Moyen	Resource control graphs.	ACM Trans. Comput. Log.	2009	DBLP DOI BibTeX RDF	non-size increasing computation, size change termination, program analysis, Implicit computational complexity, program termination
1	Ugo Dal Lago, Luca Roversi, Luca Vercelli	Taming Modal Impredicativity: Superlazy Reduction.	LFCS	2009	DBLP DOI BibTeX RDF	Linear logic, proof theory, implicit computational complexity
1	Norman Danner, James S. Royer	Two Algorithms in Search of a Type-System.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Higher-type computation, Higher-type complexity, Basic feasible functionals, Compositional semantics, Implicit computational complexity
1	Ugo Dal Lago, Simone Martini	On Constructor Rewrite Systems and the Lambda-Calculus.	ICALP	2009	DBLP DOI BibTeX RDF
1	Martin Avanzini, Georg Moser, Andreas Schnabl	Automated Implicit Computational Complexity Analysis (System Description).	IJCAR	2008	DBLP DOI BibTeX RDF
1	Jean-Yves Marion, Romain Péchoux	Analyzing the Implicit Computational Complexity of object-oriented programs.	FSTTCS	2008	DBLP DOI BibTeX RDF
1	Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca	A logical account of pspace.	POPL	2008	DBLP DOI BibTeX RDF	type assignment, linear logic, implicit computational complexity, polynomial space
1	Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen	Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time.	CiE	2008	DBLP DOI BibTeX RDF	linear time complexity, static program analysis, polynomial time complexity, implicit computational complexity
1	Luca Roversi, Luca Vercelli	Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets.	TYPES	2008	DBLP DOI BibTeX RDF	Structural Proof-theory, Polynomial Time Computations, Linear Logic, Implicit Computational Complexity
1	Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem	Recursion Schemata for NCk.	CSL	2008	DBLP DOI BibTeX RDF
1	Jean-Yves Marion, Romain Péchoux	A Characterization of NCk.	TAMC	2008	DBLP DOI BibTeX RDF
1	Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux	Quasi-interpretation Synthesis by Decomposition.	ICTAC	2007	DBLP DOI BibTeX RDF
1	Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux	A Characterization of Alternating Log Time by First Order Functional Programs.	LPAR	2006	DBLP DOI BibTeX RDF
1	Jean-Yves Marion	Editorial: Implicit Computational Complexity.	Theor. Comput. Sci.	2004	DBLP DOI BibTeX RDF
1	Daniel Leivant	Implicit Computational Complexity for Higher Type Functionals.	CSL	2002	DBLP DOI BibTeX RDF
1	Neil D. Jones	Program Analysis for Implicit Computational Complexity.	PADO	2001	DBLP DOI BibTeX RDF
1	Jan Johannsen	Weak Bounded Arithmetic, the Diffie-Hellman Problem and Constable's Class K.	LICS	1999	DBLP DOI BibTeX RDF	feasible interpolation, cryptographic hardness assumption, function algebra, bounded arithmetic, implicit computational complexity, Diffie-Hellman problem