咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是21-30 订阅
排序:
The role of polymorphism in the characterisation of complexity by soft types
收藏 引用
INFORMATION AND COMPUTATION 2016年 248卷 130-149页
作者: Chrzaszcz, Jacek Schubert, Aleksy Univ Warsaw Inst Informat Ul Banacha 2 PL-02097 Warsaw Poland
Soft type assignment systems STA, STA(+), and STA(B) characterise by means of reduction of terms computation in complexity classes PTIME, NP, and PSPACE, respectively. All these systems are inspired by linear logic an... 详细信息
来源: 评论
BUILD YOUR OWN CLARITHMETIC I: SETUP AND COMPLETENESS
收藏 引用
LOGICAL METHODS IN COMPUTER SCIENCE 2016年 第3期12卷
作者: Japaridze, Giorgi Villanova Univ Dept Comp Sci 800 Lancaster Ave Villanova PA 19085 USA
Clarithmetics are number theories based on computability logic. Formulas of these theories represent interactive computational problems, and their "truth" is understood as existence of an algorithmic solutio... 详细信息
来源: 评论
Bounded Combinatory Logic and lower complexity
收藏 引用
INFORMATION AND COMPUTATION 2016年 248卷 215-226页
作者: Redmond, Brian F. Grande Prairie Reg Coll Dept Comp Math & Stat Sci 10726-106 Ave Grande Prairie AB T8V 4C4 Canada
We introduce a stratified version of Combinatory Logic(1) in which there are two classes of terms called player and opponent such that the class of player terms is strictly contained in the class of opponent terms. We... 详细信息
来源: 评论
BUILD YOUR OWN CLARITHMETIC II: SOUNDNESS
收藏 引用
LOGICAL METHODS IN COMPUTER SCIENCE 2016年 第3期12卷
作者: Japaridze, Giorgi Villanova Univ Dept Comp Sci 800 Lancaster Ave Villanova PA 19085 USA
Clarithmetics are number theories based on computability logic. Formulas of these theories represent interactive computational problems, and their "truth" is understood as existence of an algorithmic solutio... 详细信息
来源: 评论
Computation by interaction for space-bounded functional programming
收藏 引用
INFORMATION AND COMPUTATION 2016年 248卷 150-194页
作者: Dal Lago, Ugo Schoepp, Ulrich Univ Bologna I-40126 Bologna Italy INRIA Sophia Antipolis Nice France Univ Munich Marchioninistr 15 D-81377 Munich Germany
When programming with sublinear space constraints one often needs to use special implementation techniques even for simple tasks, such as function composition. In this paper, we study how such implementation technique... 详细信息
来源: 评论
Introduction to clarithmetic II
收藏 引用
INFORMATION AND COMPUTATION 2016年 247卷 290-312页
作者: Japaridze, Giorgi Villanova Univ Dept Comp Sci 800 Lancaster Ave Villanova PA 19085 USA
The earlier paper "Introduction to clarithmetic I" constructed an axiomatic system of arithmetic based on computability logic, and proved its soundness and extensional completeness with respect to polynomial... 详细信息
来源: 评论
Higher-order interpretations and program complexity
收藏 引用
INFORMATION AND COMPUTATION 2016年 248卷 56-81页
作者: Baillot, Patrick Dal Lago, Ugo Univ Lyon 1 CNRS INRIA Ecole Normale Super LyonLab Informat Parallelism F-69622 Villeurbanne France Univ Bologna I-40126 Bologna Italy INRIA Sophia Antipolis Nice France
Polynomial interpretations and their generalizations like quasi-interpretations have been used in the setting of first-order functional languages to design criteria ensuring statically some complexity bounds on progra... 详细信息
来源: 评论
Light combinators for finite fields arithmetic
收藏 引用
SCIENCE OF COMPUTER PROGRAMMING 2015年 第Part3期111卷 365-394页
作者: Canavese, D. Cesena, E. Ouchary, R. Pedicini, M. Roversi, L. Politecn Torino Dipartimento Automat & Informat I-10129 Turin Italy Theneeds Inc San Francisco CA USA Univ Rome Tre Dipartimento Matemat & Fis I-00146 Rome Italy Univ Turin Dipartimento Informat I-10149 Turin Italy
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 specific features. Such a functional terms have type in Typ... 详细信息
来源: 评论
On bounding space usage of streams using interpretation analysis
收藏 引用
SCIENCE OF COMPUTER PROGRAMMING 2015年 第Part3期111卷 395-425页
作者: Gaboardi, Marco Pechoux, Romain Harvard Univ Cambridge MA 02138 USA Univ Dundee Dundee DD1 4HN Scotland Univ Lorraine INRIA Project Carte Loria UMR 7503 Nancy France
Interpretation methods are important tools in implicit computational complexity. They have been proved particularly useful to statically analyze and to limit the complexity of programs. However, most of these studies ... 详细信息
来源: 评论
An abstract approach to stratification in linear logic
收藏 引用
INFORMATION AND COMPUTATION 2015年 241卷 32-61页
作者: Boudes, Pierre Mazza, Damiano de Falco, Lorenzo Tortora Univ Paris 13 CNRS LIPN Sorbonne Paris Cite F-93430 Villetaneuse France Univ Paris 13 CNRS UMR 7030 LIPNSorbonne Paris Cite F-93430 Villetaneuse France Univ Roma Tre Dipartimento Filosofia Rome Italy
We study the notion of stratification, as used in subsystems of linear logic with low complexity bounds on the cut-elimination procedure (the so-called "light" subsystems), from an abstract point of view, in... 详细信息
来源: 评论