咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是31-40 订阅
排序:
On the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy
收藏 引用
INFORMATION AND COMPUTATION 2015年 241卷 3-31页
作者: Baillot, Patrick Univ Lyon LIP CNRS ENS LyonInriaUCBL Lyon France
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 functions, that is to say functions computable in time bound... 详细信息
来源: 评论
Realizability models for a linear dependent PCF
收藏 引用
THEORETICAL COMPUTER SCIENCE 2015年 585卷 55-70页
作者: Brunel, Alois Gaboardi, Marco Univ Paris 13 UMR CNRS 7030 LIPN F-93430 Villetaneuse France Univ Dundee Sch Comp Dundee DD1 4HN Scotland
Recently, Dal Lago and Gaboardi have proposed a type system, named dlPCF as a framework for implicit computational complexity. dlPCF is a non-standard type system for PCF programs which is relatively complete with res... 详细信息
来源: 评论
Real or natural number interpretation and their effect on complexity
收藏 引用
THEORETICAL COMPUTER SCIENCE 2015年 585卷 25-40页
作者: Bonfante, Guillaume Deloup, Florian Henrot, Antoine Univ Lorraine LORIA Nancy France Univ Toulouse 3 Toulouse IMT F-31062 Toulouse France Univ Lorraine IECN Nancy France
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 interpretation of a program induces a bound on its complex... 详细信息
来源: 评论
A higher-order characterization of probabilistic polynomial time
收藏 引用
INFORMATION AND COMPUTATION 2015年 241卷 114-141页
作者: Dal Lago, Ugo Toldin, Paolo Parisen Univ Bologna Dipartimento Sci Informaz Equipe FOCUS INRIA Sophia Antipolis I-40127 Bologna Italy
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 probability smaller than 1/2. Analogously, a (less implicit... 详细信息
来源: 评论
On Sharing, Memoization, and Polynomial Time  32
On Sharing, Memoization, and Polynomial Time
收藏 引用
32nd International Symposium on Theoretical Aspects of Computer Science (STACS)
作者: Avanzini, Martin Dal Lago, Ugo Univ Bologna Bologna Italy INRIA Bologna Italy
We study how the adoption of an evaluation mechanism with sharing and memoization impacts the class of functions which can be computed in polynomial time. We first show how a natural cost model in which lookup for an ... 详细信息
来源: 评论
Algebras and Coalgebras in the Light Affine Lambda Calculus  2015
Algebras and Coalgebras in the Light Affine Lambda Calculus
收藏 引用
20th ACM SIGPLAN International Conference on Functional Programming (ICFP)
作者: Gaboardi, Marco Pechoux, Romain Univ Dundee Dundee DD1 4HN Scotland Univ Lorraine Nancy France
Algebra and coalgebra are widely used to model data types in functional programming languages and proof assistants. Their use permits to better structure the computations and also to enhance the expressivity of a lang... 详细信息
来源: 评论
A new order-theoretic characterisation of the polytime computable functions
收藏 引用
THEORETICAL COMPUTER SCIENCE 2015年 585卷 3-24页
作者: Avanzini, Martin Eguchi, Naohi Moser, Georg Univ Innsbruck Inst Comp Sci A-6020 Innsbruck Austria
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* for short). This termination order entails a new syntacti... 详细信息
来源: 评论
ON THE SYSTEM CL12 OF COMPUTABILITY LOGIC
收藏 引用
LOGICAL METHODS IN COMPUTER SCIENCE 2015年 第3期11卷
作者: Japaridze, Giorgi Villanova Univ Dept Comp Sci Villanova PA 19085 USA
Computability logic (CoL) is a long-term project for redeveloping logic on the basis of a constructive game semantics, with games seen as abstract models of interactive computational problems. Among the fragments of C... 详细信息
来源: 评论
Safe recursion revisited I: Categorical semantics for lower complexity
收藏 引用
THEORETICAL COMPUTER SCIENCE 2014年 515卷 19-45页
作者: Burrell, Mike Cockett, Robin Redmond, Brian Univ Western Ontario Dept Comp Sci London ON Canada Univ Calgary Dept Comp Sci Calgary AB T2N 1N4 Canada
The objective of this paper is to prove that the initial Polo setting, with both inductive and coinductive data, is sound for polynomial size (PSIZE). Explicitly this means all programs written in Pola have their outp... 详细信息
来源: 评论
Linear dependent types in a call-by-value scenario
收藏 引用
SCIENCE OF COMPUTER PROGRAMMING 2014年 84卷 77-100页
作者: Dal Lago, Ugo Petit, Barbara INRIA Sophia Antipolis Bologna Italy Univ Bologna I-40126 Bologna Italy INRIA Rhone Alpes Grenoble France
Linear dependent types were introduced recently (Dal Lago and Gaboardi, 2012) [26] as a formal system that allows to precisely capture both the extensional behavior and the time complexity of A-terms, when the latter ... 详细信息
来源: 评论