Výsledky vyhľadávania - "Implicit computational complexity"

Reversible computing and implicit computational complexity Autor Kristiansen, Lars

“…•We argue that there is a link between implicit computational complexity theory and reversible computation.•We introduce inherently reversible programming…”
Získať plný text

Polynomial Time and Dependent Types Autor Atkey, Robert

“…We combine dependent types with linear type systems that soundly and completely capture polynomial time computation. We explore two systems for capturing…”
Získať plný text

Types for Complexity of Parallel Computation in Pi-Calculus

Získať plný text

Computation by interaction for space-bounded functional programming Autor Dal Lago, Ugo, Schöpp, Ulrich

“…When programming with sublinear space constraints one often needs to use special implementation techniques even for simple tasks, such as function composition…”
Získať plný text

A tier-based typed programming language characterizing Feasible Functionals Autor Hainry, Emmanuel, Kapron, Bruce M., Marion, Jean-Yves, Péchoux, Romain

“…The class of Basic Feasible Functionals BFF$_2$ is the type-2 counterpart of the class FP of type-1 functions computable in polynomial time. Several…”
Získať plný text

A higher-order characterization of probabilistic polynomial time Autor Dal Lago, Ugo, Parisen Toldin, Paolo

“…We present RSLR, an implicit higher-order characterization of the class PP of those problems which can be decided in probabilistic polynomial time with error…”
Získať plný text

Higher-order interpretations and program complexity Autor Baillot, Patrick, Dal Lago, Ugo

“…Polynomial interpretations and their generalizations like quasi-interpretations have been used in the setting of first-order functional languages to design…”
Získať plný text

Theory of higher order interpretations and application to Basic Feasible Functions Autor Hainry, Emmanuel, Péchoux, Romain

“…Interpretation methods and their restrictions to polynomials have been deeply used to control the termination and complexity of first-order term rewrite…”
Získať plný text

Primitive recursion in the abstract Autor Leivant, Daniel, Marion, Jean-Yves

“…Recurrence can be used as a function definition schema for any nontrivial free algebra, yielding the same computational complexity in all cases. We show that…”
Získať plný text

Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs Autor Baillot, Patrick, Barthe, Gilles, Dal Lago, Ugo

“…We define a call-by-value variant of Gödel’s system T with references, and equip it with a linear dependent type and effect system, called d ℓ T , that can…”
Získať plný text

Linear Dependent Types and Relative Completeness Autor Dal Lago, Ugo, Gaboardi, M.

“…A system of linear dependent types for the lambda calculus with full higher-order recursion, called dℓPCF, is introduced and proved sound and relatively…”
Získať plný text

Interaction Graphs: Exponentials Autor Seiller, Thomas

“…This paper is the fourth of a series exposing a systematic combinatorial approach to Girard's Geometry of Interaction (GoI) program. The GoI program aims at…”
Získať plný text

Realizability models for a linear dependent PCF Autor Brunel, Aloïs, Gaboardi, Marco

“…Recently, Dal Lago and Gaboardi have proposed a type system, named dℓPCF as a framework for implicit computational complexity. dℓPCF is a non-standard type…”
Získať plný text

Light combinators for finite fields arithmetic Autor Canavese, D., Cesena, E., Ouchary, R., Pedicini, M., Roversi, L.

“…This work completes the definition of a library which provides the basic arithmetic operations in binary finite fields as a set of functional terms with very…”
Získať plný text

A new order-theoretic characterisation of the polytime computable functions Autor Avanzini, Martin, Eguchi, Naohi, Moser, Georg

“…We propose a new order-theoretic characterisation of the class of polytime computable functions. To this avail we define the small polynomial path order (sPOP⁎…”
Získať plný text

Introduction to clarithmetic II Autor Japaridze, Giorgi

Získať plný text

Real or natural number interpretation and their effect on complexity Autor Bonfante, Guillaume, Deloup, Florian, Henrot, Antoine

“…Interpretation methods have been introduced in the 70s by Lankford [1] in rewriting theory to prove termination. Actually, as shown by Bonfante et al. [2], an…”
Získať plný text

On the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy Autor Baillot, Patrick

“…Elementary linear logic is a simple variant of linear logic due to Girard and which characterizes in the proofs-as-programs approach the class of elementary…”
Získať plný text

The role of polymorphism in the characterisation of complexity by soft types Autor Chrząszcz, Jacek, Schubert, Aleksy

“…Soft type assignment systems STA, STA+, and STAB characterise by means of reduction of terms computation in complexity classes PTIME, NP, and PSPACE,…”
Získať plný text

Safe recursion revisited I: Categorical semantics for lower complexity Autor Burrell, Mike, Cockett, Robin, Redmond, Brian

“…The objective of this paper is to prove that the initial Pola setting, with both inductive and coinductive data, is sound for polynomial size (PSIZE)…”
Získať plný text