咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是81-90 订阅
排序:
Control structures in programs and computational complexity
收藏 引用
ANNALS OF PURE AND APPLIED LOGIC 2005年 第1-3期133卷 247-273页
作者: Niggl, KH Tech Univ Ilmenau Inst Theoret & Tech Informat D-98693 Ilmenau Germany
A key problem in implicit complexity is to analyse the impact on program run times of nesting control structures, such as recursion in all finite types in functional languages or for-do statements in imperative langua... 详细信息
来源: 评论
Intersection Types for Light Affine Lambda Calculus
收藏 引用
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2005年 136卷 133-152页
作者: de Carvalho, Daniel Inst Math Luminy UMR 6206 163Ave LuminyCase 907 F-13288 Marseille 9 France
Light Affine Lambda Calculus is a term calculus for polynomial time computation ([12]). Some of the terms of Light Affine Lambda Calculus must however be regarded as errors. Intuitionistic Light Affine Logic (ILAL) ty... 详细信息
来源: 评论
On the computational complexity of imperative programming languages
收藏 引用
THEORETICAL COMPUTER SCIENCE 2004年 第1-2期318卷 139-161页
作者: Kristiansen, L Niggl, KH Tech Univ Ilmenau Inst Theoret & Tech Informat D-98693 Ilmenau Germany Univ Oslo Fac Engn Oslo Norway
Two restricted imperative programming languages are considered: One is a slight modification of a loop language studied intensively in the literature, the other is a stack programming language over an arbitrary but fi... 详细信息
来源: 评论
Type inference for light affine logic via constraints on words
收藏 引用
THEORETICAL COMPUTER SCIENCE 2004年 第3期328卷 289-323页
作者: Baillot, P Univ Paris 13 CNRS Lab Informat Paris Nord UMR 7030Inst Galilee F-93430 Villetaneuse France
Light Affine Logic (LAL) is a system due to Girard and Asperti capturing the complexity class P in a proof-theoretical approach based on Linear Logic. LAL provides a typing for lambda-calculus which guarantees that a ... 详细信息
来源: 评论
An arithmetic for non-size-increasing polynomial-time computation
收藏 引用
THEORETICAL COMPUTER SCIENCE 2004年 第1-2期318卷 3-27页
作者: Aehlig, K Berger, U Hoffmann, M Schwichtenberg, H Univ Munich Inst Math D-80333 Munich Germany Univ Coll Swansea Dept Comp Sci Swansea SA2 8PP W Glam Wales Univ Munich Inst Informat D-80538 Munich Germany
An arithmetical system is presented with the property that from every proof a realizing term can be extracted that is definable in a certain affine linear typed variant of Godel's T and therefore defines a non-siz... 详细信息
来源: 评论
Minimization and NP multifunctions
收藏 引用
THEORETICAL COMPUTER SCIENCE 2004年 第1-2期318卷 105-119页
作者: Danner, N Pollett, C Univ Calif Los Angeles Dept Math Los Angeles CA 90095 USA San Jose State Univ Dept Math & Comp Sci San Jose CA 95192 USA
The implicit characterizations of the polynomial-time computable functions FP given by Bellantoni-Cook and Leivant suggest that this class is the complexity-theoretic analog of the primitive recursive functions. Hence... 详细信息
来源: 评论
The Garland Measure and computational complexity of Stack Programs
收藏 引用
Electronic Notes in Theoretical Computer Science 2003年 90卷 15-35页
作者: L. Kristiansen K.-H. Niggl Faculty of Engineering Oslo University College Oslo Norway Institut für Theoretische und Technische Informatik Technische Universität Ilmenau Helmholtzplatz 1 98684 Ilmenau Germany
A key problem in implicit computational complexity is to analyse the impact on program run times of nesting restricted control structures, such as for-do statements in imperative languages. This problem has two aspect... 详细信息
来源: 评论
Safe weak minimization revisited
收藏 引用
SIAM JOURNAL ON COMPUTING 2002年 第5期31卷 1542-1556页
作者: Spreen, D Univ Siegen Fachbereich Math D-57068 Siegen Germany
Minimization operators of different strengths have been studied in the framework of "predicative (safe) recursion." In this paper, a modi cation of these operators is presented. By adding the new operator to... 详细信息
来源: 评论
A characterization of alternating log time by ramified recurrence
收藏 引用
THEORETICAL COMPUTER SCIENCE 2000年 第1-2期236卷 193-208页
作者: Leivant, D Marion, JY Indiana Univ Dept Comp Sci Bloomington IN 47405 USA Univ Nancy 2 Loria Projet Calligramme F-54506 Vandoeuvre Nancy France
We give a machine-independent characterization of the class of functions bitwise computable in alternating logarithmic time, with output of polynomial size. Recall that ALogTime is the same, for decision problems, as ... 详细信息
来源: 评论