咨询与建议

限定检索结果

文献类型

  • 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 订阅
排序:
POLYNOMIAL PATH ORDERS
收藏 引用
LOGICAL METHODS IN COMPUTER SCIENCE 2013年 第4期9卷
作者: Avazini, Martin Moser, Georg Univ Innsbruck Inst Comp Sci A-6020 Innsbruck Austria
This paper is concerned with the complexity analysis of constructor term rewrite systems and its ramification in implicit computational complexity. We introduce a path order with multiset status, the polynomial path o... 详细信息
来源: 评论
THEORY OF HIGHER ORDER INTERPRETATIONS AND APPLICATION TO BASIC FEASIBLE FUNCTIONS
收藏 引用
LOGICAL METHODS IN COMPUTER SCIENCE 2020年 第4期16卷 14:1-14:25页
作者: Hainry, Emmanuel Pechoux, Romain Univ Lorraine LORIA INRIA CNRS F-54000 Nancy France
Interpretation methods and their restrictions to polynomials have been deeply used to control the termination and complexity of first-order term rewrite systems. This paper extends interpretation methods to a pure hig... 详细信息
来源: 评论
INTERACTION GRAPHS: EXPONENTIALS
收藏 引用
LOGICAL METHODS IN COMPUTER SCIENCE 2019年 第3期15卷
作者: Seiller, Thomas CNRS Paris France Univ Paris 13 Paris France
This paper is the fourth of a series [Sei12a, Sei16a, Sei17b] exposing a systematic combinatorial approach to Girard's Geometry of Interaction (goi) program [Gir89b]. The goi program aims at obtaining particular r... 详细信息
来源: 评论
ADVENTURES IN TIME AND SPACE
收藏 引用
Logical Methods in Computer Science 2007年 第1期3卷
作者: Danner, Norman Royer, James S. Wesleyan Univ Dept Math & Comp Sci Middletown CT 06459 USA Syracuse Univ Dept Elect Engn & Comp Sci Syracuse NY 13210 USA
This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its first-order programs characterize the polynomi... 详细信息
来源: 评论
A New Function Algebra of EXPTIME Functions by Safe Nested Recursion
收藏 引用
ACM TRANSACTIONS ON computational LOGIC 2009年 第4期10卷 1–19页
作者: Arai, Toshiyasu Eguchi, Naohi Kobe Univ Grad Sch Engn Nada Ku Kobe Hyogo 6578501 Japan
Bellantoni and Cook have given a function-algebra characterization of the polynomial-time computable functions via an unbounded recursion scheme which is called safe recursion. Inspired by their work, we characterize ... 详细信息
来源: 评论
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... 详细信息
来源: 评论
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... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Ramified Corecurrence and Logspace
收藏 引用
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2011年 276卷 247-261页
作者: Ramyaa, Ramyaa Leivant, Daniel Indiana Univ Bloomington IN 47405 USA LORIA Nancy Villers Les Nancy France
Ramified recurrence over free algebras has been used over the last two decades to provide machine-independent characterizations of major complexity classes. We consider here ramification for the dual setting, referrin... 详细信息
来源: 评论