咨询与建议

限定检索结果

文献类型

  • 72 篇 期刊文献
  • 17 篇 会议

馆藏范围

  • 89 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 84 篇 工学
    • 80 篇 计算机科学与技术...
    • 17 篇 软件工程
    • 2 篇 电气工程
    • 1 篇 控制科学与工程
  • 49 篇 理学
    • 49 篇 数学
    • 1 篇 统计学(可授理学、...
  • 13 篇 管理学
    • 13 篇 管理科学与工程(可...
  • 1 篇 哲学

主题

  • 89 篇 implicit computa...
  • 23 篇 linear logic
  • 13 篇 lambda calculus
  • 9 篇 type systems
  • 7 篇 theory
  • 7 篇 game semantics
  • 7 篇 polynomial time
  • 6 篇 complexity analy...
  • 6 篇 interactive comp...
  • 6 篇 lambda-calculus
  • 6 篇 polynomial time ...
  • 6 篇 computability lo...
  • 5 篇 polynomial space
  • 5 篇 term rewriting
  • 5 篇 bounded arithmet...
  • 5 篇 type system
  • 5 篇 type assignment
  • 4 篇 languages
  • 4 篇 light linear log...
  • 4 篇 geometry of inte...

机构

  • 5 篇 univ turin dipar...
  • 4 篇 univ bologna dip...
  • 4 篇 univ bologna bol...
  • 4 篇 univ bologna i-4...
  • 3 篇 univ innsbruck i...
  • 3 篇 villanova univ d...
  • 3 篇 villanova univ d...
  • 3 篇 univ bologna dip...
  • 2 篇 syracuse univ de...
  • 2 篇 shandong univ sc...
  • 2 篇 indiana univ blo...
  • 2 篇 univ paris 13 cn...
  • 2 篇 univ lorraine lo...
  • 2 篇 nancy univ ensmn...
  • 2 篇 univ turin dept ...
  • 2 篇 inria sophia ant...
  • 2 篇 univ dundee dund...
  • 2 篇 inria sophia ant...
  • 2 篇 tech univ ilmena...
  • 2 篇 kobe univ grad s...

作者

  • 20 篇 dal lago ugo
  • 11 篇 baillot patrick
  • 11 篇 marion jean-yves
  • 10 篇 gaboardi marco
  • 7 篇 della rocca simo...
  • 7 篇 pechoux romain
  • 6 篇 japaridze giorgi
  • 4 篇 avanzini martin
  • 4 篇 hainry emmanuel
  • 4 篇 eguchi naohi
  • 3 篇 moser georg
  • 3 篇 niggl kh
  • 3 篇 ghyselen alexis
  • 3 篇 kristiansen lars
  • 2 篇 royer james s.
  • 2 篇 mazza damiano
  • 2 篇 danner norman
  • 2 篇 terui kazushige
  • 2 篇 roversi luca
  • 2 篇 kapron bruce m.

语言

  • 84 篇 英文
  • 5 篇 其他
检索条件"主题词=Implicit computational complexity"
89 条 记 录,以下是1-10 订阅
排序:
Formally Verified Resource Bounds through implicit computational complexity  26
Formally Verified Resource Bounds through Implicit Computati...
收藏 引用
ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity (SPLASH Companion)
作者: Rusch, Neea Augusta Univ Augusta GA 30912 USA
Automatic complexity analysis has not reached mainstream adoption due to outstanding challenges, such as scalability and usability, and no formally verified analyzer exists. However, the need to evaluate resource usag... 详细信息
来源: 评论
Reversible computing and implicit computational complexity
收藏 引用
SCIENCE OF COMPUTER PROGRAMMING 2022年 213卷 102723-102723页
作者: Kristiansen, Lars Univ Oslo Dept Informat Oslo Norway Univ Oslo Dept Math Oslo Norway
We argue that there is a link between implicit computational complexity theory and reversible computation. We introduce inherently reversible programming languages which capture the complexity classes ETImE and p. Fur... 详细信息
来源: 评论
implicit computational complexity of Subrecursive Definitions and Applications to Cryptographic Proofs
收藏 引用
JOURNAL OF AUTOMATED REASONING 2019年 第4期63卷 813-855页
作者: Baillot, Patrick Barthe, Gilles Dal Lago, Ugo Univ Lyon CNRS EnsL UCBLLIP F-69342 Lyon 07 France IMDEA Software Inst Madrid Spain Univ Bologna Bologna Italy INRIA Sophia Antipolis France
We define a call-by-value variant of Godel's system T with references, and equip it with a linear dependent type and effect system, called dlT, that can estimate the time complexity of programs, as a function of t... 详细信息
来源: 评论
Polynomial Time and Dependent Types
收藏 引用
PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL 2024年 第POPL期8卷 2288-2317页
作者: Atkey, Robert Univ Strathclyde 26 Richmond St Glasgow G1 1XH Lanark Scotland
We combine dependent types with linear type systems that soundly and completely capture polynomial time computation. We explore two systems for capturing polynomial time: one system that disallows construction of iter... 详细信息
来源: 评论
Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories  32
Enumerating Error Bounded Polytime Algorithms Through Arithm...
收藏 引用
32nd EACSL Annual Conference on Computer Science Logic (CSL)
作者: Antonelli, Melissa Dal Lago, Ugo Davoli, Davide Oitavem, Isabel Pistone, Paolo Helsinki Inst Informat Technol Helsinki Finland Bologna Univ Bologna Italy Univ Cote Azur Inria Sophia Antipolis France NOVA FCT Ctr Math & Applicat NOVA Math Caparica Portugal NOVA FCT Dept Math Caparica Portugal
We consider a minimal extension of the language of arithmetic, such that the bounded formulas provably total in a suitably-defined theory a la Buss (expressed in this new language) precisely capture polytime random fu... 详细信息
来源: 评论
implicit recursion-theoretic characterizations of counting classes
收藏 引用
ARCHIVE FOR MATHEMATICAL LOGIC 2022年 第7-8期61卷 1129-1144页
作者: Dal Lago, Ugo Kahle, Reinhard Oitavem, Isabel Univ Bologna Bologna Italy INRIA Sophia Antipolis Valbonne France Univ Tubingen Carl Friedrich von Weizsacker Ctr Tubingen Germany Univ Nova Lisboa CMA FCT Caparica Portugal Univ Nova Lisboa NOVA Sch Sci & Technol CMA & DM P-2829515 Caparica Portugal
We give recursion-theoretic characterizations of the counting class #P, the class of those functions which count the number of accepting computations of non-deterministic Turing machines working in polynomial time. Mo... 详细信息
来源: 评论
Types for complexity of Parallel Computation in Pi-Calculus  1
收藏 引用
30th European Symposium on Programming (ESOP) Held as Part of the 24th European Joint Conferences on Theory and Practice of Software (ETAPS)
作者: Baillot, Patrick Ghyselen, Alexis Univ Claude Bernard Lyon 1 LIP Univ Lyon CNRSENS Lyon F-69342 Lyon 07 France
Type systems as a technique to analyse or control programs have been extensively studied for functional programming languages. In particular some systems allow to extract from a typing derivation a complexity bound on... 详细信息
来源: 评论
Types for complexity of Parallel Computation in Pi-calculus
收藏 引用
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS 2022年 第3期44卷 15-15页
作者: Baillot, Patrick Ghyselen, Alexis Univ Claude Bernard Lyon 1 Univ Lyon LIP ENS LyonCNRS F-69342 Lyon 07 France Univ Lille CRIStAL Bat ESPRITAve Henri Poincare F-59655 Villeneuve Dascq France Univ Bologna Alma Mater Studiorum DIAPASoN Via Zamboni 33 I-40126 Bologna Italy
Type systems as a technique to analyse or control programs have been extensively studied for functional programming languages. In particular, some systems allow one to extract from a typing derivation a complexity bou... 详细信息
来源: 评论
A TIER-BASED TYPED PROGRAMMING LANGUAGE CHARACTERIZING FEASIBLE FUNCTIONALS
收藏 引用
LOGICAL METHODS IN COMPUTER SCIENCE 2022年 第1期18卷 33:1-33:31页
作者: Hainry, Emmanuel Kapron, Bruce M. Marion, Jean-Yves Pechoux, Romain Univ Lorraine CNRS INRIA LORIA F-54000 Nancy France Univ Victoria Victoria BC Canada
The class of Basic Feasible Functionals BFF2 is the type-2 counterpart of the class FP of type-1 functions computable in polynomial time. Several characterizations have been suggested in the literature, but none of th... 详细信息
来源: 评论
Combining linear logic and size types for implicit complexity
收藏 引用
THEORETICAL COMPUTER SCIENCE 2020年 813卷 70-99页
作者: Baillot, Patrick Ghyselen, Alexis Univ Claude Bernard Lyon I Univ Lyon CNRS ENS Lyon F-69342 Lyon 07 France
Several type systems have been proposed to statically control the time complexity of lambda-calculus programs and characterize complexity classes such as FPTIME or FEXPTIME. A first line of research stems from linear ... 详细信息
来源: 评论