咨询与建议

限定检索结果

文献类型

  • 5 篇 期刊文献
  • 2 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 6 篇 工学
    • 6 篇 计算机科学与技术...
  • 3 篇 理学
    • 3 篇 数学

主题

  • 7 篇 untyped lambda-c...
  • 2 篇 scott's continuo...
  • 2 篇 lambda abstracti...
  • 2 篇 easy terms
  • 2 篇 webbed models
  • 2 篇 lattice of lambd...
  • 2 篇 combinatory alge...
  • 2 篇 graph models
  • 1 篇 computational ad...
  • 1 篇 denotational sem...
  • 1 篇 finite powerset
  • 1 篇 engeler model
  • 1 篇 positive set the...
  • 1 篇 finite multiset
  • 1 篇 bohm trees
  • 1 篇 frege's system
  • 1 篇 distributive law
  • 1 篇 innocent strateg...
  • 1 篇 cartesian closed...
  • 1 篇 commutative mono...

机构

  • 2 篇 cnrs f-72251 par...
  • 2 篇 univ paris 07 f-...
  • 2 篇 univ ca foscari ...
  • 1 篇 univ cambridge d...
  • 1 篇 univ libre bruxe...
  • 1 篇 univ aarhus dept...
  • 1 篇 japan sci & tech...
  • 1 篇 univ copenhagen ...
  • 1 篇 univ oxford comp...
  • 1 篇 univ genoa disi ...
  • 1 篇 univ lyon lab li...
  • 1 篇 univ edinburgh l...
  • 1 篇 univ grenoble la...
  • 1 篇 inria 23 ave ita...

作者

  • 2 篇 salibra a
  • 2 篇 berline c
  • 1 篇 filinski a
  • 1 篇 nagayama misao
  • 1 篇 ker ad
  • 1 篇 arrighi pablo
  • 1 篇 power john
  • 1 篇 ong chl
  • 1 篇 rohde hk
  • 1 篇 rosolini giusepp...
  • 1 篇 nickau h
  • 1 篇 dowek gilles
  • 1 篇 hyland martin x
  • 1 篇 libert thierry

语言

  • 6 篇 英文
  • 1 篇 其他
检索条件"主题词=untyped lambda-calculus"
7 条 记 录,以下是1-10 订阅
排序:
A Category Theoretic Formulation for Engeler-style Models of the untyped lambda-calculus
收藏 引用
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2006年 第1期161卷 43-57页
作者: Hyland, Martin x Nagayama, Misao Power, John Rosolini, Giuseppe Univ Cambridge Dept Pure Math & Math Stat Wilberforce Rd Cambridge CB30WB England Japan Sci & Technology Corp Res Ctr Verificat & Semant CVS Natl Inst Adv Ind Sci & Technol AIST CREST Amagasaki Hyogo 6610974 Japan Univ Edinburgh Lab Foundat Comp Sci Edinburgh EH9 3JZ Midlothian Scotland Univ Genoa DISI I-16146 Genoa Italy
We give a category-theoretic formulation of Engeler-style models for the untyped A-calculus. In order to do so, we exhibit an equivalence between distributive laws and extensions of one monad to the Kleisli category o... 详细信息
来源: 评论
Innocent game models of untyped λ-calculus
收藏 引用
THEORETICAL COMPUTER SCIENCE 2002年 第1-2期272卷 247-292页
作者: Ker, AD Nickau, H Ong, CHL Univ Oxford Comp Lab Oxford OX1 3QD England
We present a new denotational model for the untyped lambda-calculus, using the techniques of game semantics. The strategies used are innocent in the sense of Hyland and Ong (Inform. and Comput., to appear) and Nickau ... 详细信息
来源: 评论
Denotational aspects of untyped normalization by evaluation
Denotational aspects of untyped normalization by evaluation
收藏 引用
7th International Conference on Foundations of Software Science and Computation Structures
作者: Filinski, A Rohde, HK Univ Copenhagen Dept Comp Sci DIKU DK-2100 Copenhagen Denmark Univ Aarhus Dept Comp Sci BRICS IT Parken DK-8200 Aarhus Denmark
We show that the standard normalization-by-evaluation construction for the simply-typed lambda(beta eta)-calculus has a natural counterpart for the untyped lambda(beta)-calculus, with the central type-indexed logical ... 详细信息
来源: 评论
LINEAL: A LINEAR-ALGEBRAIC λ-calculus
收藏 引用
LOGICAL METHODS IN COMPUTER SCIENCE 2017年 第1期13卷
作者: Arrighi, Pablo Dowek, Gilles Univ Grenoble Lab LIG UMR 5217 220 Rue Chim F-38400 St Martin Dheres France Univ Lyon Lab LIP UMR 5668 46 Allee Italie F-69007 Lyon France INRIA 23 Ave ItalieCS 81321 F-75214 Paris 13 France
We provide a computational definition of the notions of vector space and bilinear functions. We use this result to introduce a minimal language combining higher order computation and linear algebra. This language exte... 详细信息
来源: 评论
Positive Frege and its Scott-style semantics
收藏 引用
MATHEMATICAL LOGIC QUARTERLY 2008年 第4期54卷 410-434页
作者: Libert, Thierry Univ Libre Bruxelles Dept Math B-1050 Brussels Belgium
We show that the untyped lambda-calculus can be extended with Frege's interpretation of propositional notions, provided we restrict beta-conversion to positive expressions. The system of illative lambda-calculus s... 详细信息
来源: 评论
Easiness in graph models
收藏 引用
THEORETICAL COMPUTER SCIENCE 2006年 第1期354卷 4-23页
作者: Berline, C Salibra, A CNRS F-72251 Paris 05 France Univ Paris 07 F-72251 Paris 05 France Univ Ca Foscari Venezia Dipartimento Informat I-30172 Venice Italy
We generalize Baeten and Boerboom's method of forcing to show that there is a fixed sequence (u(k))(k is an element of omega) of closed (untyped) lambda-terms satisfying the following properties: (a) For any count... 详细信息
来源: 评论
Easiness in graph models
Easiness in graph models
收藏 引用
3rd International Workshop on Algebraic Methods in Language Processing
作者: Berline, C Salibra, A CNRS F-72251 Paris 05 France Univ Paris 07 F-72251 Paris 05 France Univ Ca Foscari Venezia Dipartimento Informat I-30172 Venice Italy
We generalize Baeten and Boerboom's method of forcing to show that there is a fixed sequence (u(k))(k is an element of omega) of closed (untyped) lambda-terms satisfying the following properties: (a) For any count... 详细信息
来源: 评论