咨询与建议

限定检索结果

文献类型

  • 128 篇 期刊文献
  • 114 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 220 篇 工学
    • 208 篇 计算机科学与技术...
    • 166 篇 软件工程
    • 14 篇 电气工程
    • 11 篇 控制科学与工程
    • 8 篇 信息与通信工程
    • 4 篇 电子科学与技术(可...
    • 2 篇 化学工程与技术
    • 1 篇 机械工程
    • 1 篇 仪器科学与技术
    • 1 篇 建筑学
    • 1 篇 土木工程
    • 1 篇 测绘科学与技术
    • 1 篇 航空宇航科学与技...
    • 1 篇 生物工程
    • 1 篇 安全科学与工程
  • 92 篇 理学
    • 89 篇 数学
    • 4 篇 化学
    • 3 篇 统计学(可授理学、...
    • 1 篇 物理学
    • 1 篇 生物学
    • 1 篇 系统科学
  • 36 篇 管理学
    • 26 篇 管理科学与工程(可...
    • 12 篇 图书情报与档案管...
    • 9 篇 工商管理
  • 3 篇 经济学
    • 3 篇 应用经济学
    • 1 篇 理论经济学
  • 3 篇 教育学
    • 2 篇 教育学
    • 1 篇 心理学(可授教育学...
  • 2 篇 医学
    • 1 篇 临床医学

主题

  • 242 篇 programming theo...
  • 10 篇 programming and ...
  • 5 篇 software enginee...
  • 5 篇 software testing
  • 4 篇 high level langu...
  • 3 篇 programming
  • 3 篇 ada
  • 3 篇 graph theory
  • 3 篇 software reliabi...
  • 3 篇 wireless mesh ne...
  • 3 篇 formal specifica...
  • 3 篇 capacity optimiz...
  • 3 篇 programming envi...
  • 3 篇 channel allocati...
  • 2 篇 parallel process...
  • 2 篇 formal logic
  • 2 篇 automation
  • 2 篇 automatic testin...
  • 2 篇 reliability theo...
  • 2 篇 formal languages

机构

  • 2 篇 univ of pennsylv...
  • 2 篇 mgu im. m.v. lom...
  • 2 篇 moskovskij gosud...
  • 2 篇 inria rocquencou...
  • 2 篇 ecole des mines ...
  • 2 篇 inst kibernetiki...
  • 2 篇 aarhus univ aarh...
  • 2 篇 univ oxford comp...
  • 2 篇 city univ london...
  • 2 篇 eindhoven univ t...
  • 2 篇 univ calif berke...
  • 2 篇 univ of nottingh...
  • 1 篇 beijing univ of ...
  • 1 篇 poznan universit...
  • 1 篇 addis ababa univ...
  • 1 篇 hewlett-packard ...
  • 1 篇 technion israel ...
  • 1 篇 johann wolfgang ...
  • 1 篇 national institu...
  • 1 篇 at&t research

作者

  • 3 篇 liu yanhong a.
  • 2 篇 banach r
  • 2 篇 stuckey peter j.
  • 2 篇 kiselyov oleg
  • 2 篇 cousot patrick
  • 2 篇 desharnais j
  • 2 篇 zakharov v.a.
  • 2 篇 duggan d
  • 2 篇 nielson flemming
  • 2 篇 stoller scott d.
  • 2 篇 nielson hanne ri...
  • 2 篇 henzinger thomas...
  • 2 篇 sheard tim
  • 2 篇 mili a
  • 2 篇 rehof jakob
  • 1 篇 merz stephan
  • 1 篇 davidov mikhail
  • 1 篇 puel laurence
  • 1 篇 mai zhongfan
  • 1 篇 ignatushchenko v...

语言

  • 209 篇 英文
  • 17 篇 其他
  • 12 篇 俄文
  • 4 篇 中文
检索条件"主题词=Programming Theory"
242 条 记 录,以下是141-150 订阅
排序:
Essence of functional programming (Invited talk)
Essence of functional programming (Invited talk)
收藏 引用
19th Annual ACM SIGPLAN-SIGACT Symposium on Principles of programming Languages, POPL'92
作者: Wadler, Philip Univ of Glasgow Glasgow United Kingdom
This paper explores the use monads to structure functional programs. No prior knowledge of monads or category theory is required. Monads increase the ease with which programs may be modified. They can mimic the effect... 详细信息
来源: 评论
Discovering auxiliary information for incremental computation  96
Discovering auxiliary information for incremental computatio...
收藏 引用
The 1996 ACM SIGPLAN-SIGACT Symposium on Principles of programming Languages, POPL'96
作者: Liu, Yanhong A. Stoller, Scott D. Teitelbaum, Tim Cornell Univ Ithaca NY United States
This paper presents program analyses and transformations that discover a general class of auxiliary information for any incremental computation problem. Combining these techniques with previous techniques for caching ... 详细信息
来源: 评论
Type-directed partial evaluation  96
Type-directed partial evaluation
收藏 引用
The 1996 ACM SIGPLAN-SIGACT Symposium on Principles of programming Languages, POPL'96
作者: Danvy, Olivier Aarhus Univ Aarhus Denmark
We present a strikingly simple partial evaluator, that is type-directed and reifies a compiled program into the text of a residual, specialized program. Our partial evaluator is concise (a few lines) and it handles th... 详细信息
来源: 评论
Strongly typed flow-directed representation transformations
Strongly typed flow-directed representation transformations
收藏 引用
Proceedings of the 1997 ACM SIGPLAN International Conference on Functional programming, ICFP
作者: Dimock, Allyn Muller, Robert Turbak, Franklyn Wells, J.B. Harvard Univ Cambridge United States
We present a new framework for transforming data representations in a strongly typed intermediate language. Our method allows both value producers (sources) and value consumers (sinks) to support multiple representati... 详细信息
来源: 评论
Sequential synthesis for table look up PGA's
Sequential synthesis for table look up PGA's
收藏 引用
Proceedings Euro ASIC '92
作者: Murgai, Rajeev Brayton, Robert K. Sangiovanni-Vincentelli, Alberto Univ of California Berkeley United States
The algorithms for synthesis onto programmable gate arrays (PGAs) have so far addressed only the combinational logic problem. We present two algorithms for mapping a sequential circuit onto a specific table look up ar... 详细信息
来源: 评论
Distillation: Extracting the essence of programs  07
Distillation: Extracting the essence of programs
收藏 引用
2007 ACM SIGPLAN Workshop Partial Evaluation and Semantics-Based Program Manipulation
作者: Hamilton, G.W. School of Computing Dublin City University
In this paper, we present a new transformation algorithm called distillation which can automatically transform higher-order functional programs into equivalent tail-recursive programs. Using this algorithm, it is poss... 详细信息
来源: 评论
Revisiting catamorphisms over dataypes with embedded functions
Revisiting catamorphisms over dataypes with embedded functio...
收藏 引用
The 1996 ACM SIGPLAN-SIGACT Symposium on Principles of programming Languages, POPL'96
作者: Fegaras, Leonidas Sheard, Tim Oregon Graduate Inst of Science & Technology Portland OR United States
We revisit the work of Paterson and of Meijer & Hutton, which describes how to construct catamorphisms for recursive datatype definitions that embed contravariant occurrences of the type being defined. Their const... 详细信息
来源: 评论
Types as abstract interpretations  97
Types as abstract interpretations
收藏 引用
The 1997 24th ACM SIGPLAN-SIGACT Symposium on Principles of programming Languages, POPL'97
作者: Cousot, Patrick Ecole Normale Superieure Paris France
Starting from a denotational semantics of the eager untyped lambda-calculus with explicit runtime errors, the standard collecting semantics is defined as specifying the strongest program properties. By a first abstrac... 详细信息
来源: 评论
Bounded quantification is undecidable  92
Bounded quantification is undecidable
收藏 引用
19th Annual ACM SIGPLAN-SIGACT Symposium on Principles of programming Languages, POPL'92
作者: Pierce, Benjamin C. Carnegie Mellon Univ Pittsburgh PA United States
F≤ is a typed λ-calculus with subtyping and bounded second-order polymorphism. First proposed by Cardelli and Wegner, it has been widely studied as a core calculus for type systems with subtyping. Curien and Ghelli ... 详细信息
来源: 评论
Evolutionary computation with extinction: Experiments and analysis
Evolutionary computation with extinction: Experiments and an...
收藏 引用
Proceedings of the 2000 Congress on Evolutionary Computation
作者: Fogel, Gary B. Greenwood, Garrison W. Chellapilla, Kumar Natural Selection Inc La Jolla United States
Under a species-level abstraction of classical evolutionary programming, the standard tournament selection model is not appropriate. When viewed in this manner, it is more appropriate to consider two modes of life his... 详细信息
来源: 评论