The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.

## Filters

##
###
Page 4082 of Mathematical Reviews Vol. , Issue 98G
[page]

1998
*
Mathematical Reviews
*

We then prove that the translation preserves typability

*of**lambda*-terms*in*various*typed**lambda*-*calculi*. ... This result is a counterpart*of*the distinguished result*of*R. Loader*in*which*lambda*terms are evaluated*in**finite*domains for which undecidability*of**lambda*definabilty is proved.” ...##
###
Page 7304 of Mathematical Reviews Vol. , Issue 97M
[page]

1997
*
Mathematical Reviews
*

adopted

*in*the majority*of*the papers dealing with*typing*, not only for*lambda**calculi*. ... The classifications*of**typed**lambda**calculi*and*of*systems*of*intuitionistic logic through cubes are usually called “Barendregt’s cubes”. ...##
###
Page 754 of Mathematical Reviews Vol. 58, Issue 2
[page]

1979
*
Mathematical Reviews
*

Nederpelt [“Strong normalization

*in*a*typed**lambda*calculus with*lambda*structured*types*”, Ph. D. Thesis, Techn, Hogesch. ... The language AUT-QE,*developed*by N. de Bruijn’s group at Eindhoven from his AUTOMATH, has at its core a*typed*}- calculus*in*which the*types*may themselves be*typed*A-terms. ...##
###
Page 6544 of Mathematical Reviews Vol. , Issue 2000i
[page]

2000
*
Mathematical Reviews
*

A typical application is the proof

*of*confluence from*finite*- ness*of**developments*: by labelling each subterm with a natural number indicating the maximum number*of*times this term may participate*in*a ... (English summary)*Typed**lambda**calculi*and applications (L’ Aquila, 1999), 162-176, Lecture Notes*in*Comput. Sci., 1581, Springer, Berlin, 1999. ...##
###
Remarks on isomorphisms in typed lambda calculi with empty and sum types

2006
*
Annals of Pure and Applied Logic
*

This paper studies isomorphisms

doi:10.1016/j.apal.2005.09.001
fatcat:qhjwn75pofblvdhm6w7rirmnvq
*in**typed**lambda**calculi*with empty and sum*types*from this viewpoint. ... We close an open problem by establishing that the theory*of**type*isomorphisms*in*the presence*of*product, arrow, and sum*types*(with or without the unit*type*) is not*finitely*axiomatisable. ... Introduction We study isomorphisms*in**typed**lambda**calculi*with empty and sum*types*from the viewpoint*of*programming language theory, category theory, and logic. ...##
###
Modeling Simply-Typed Lambda Calculi in the Category of Finite Vector Spaces

2014
*
Scientific Annals of Computer Science
*

Modeling Simply-

doi:10.7561/sacs.2014.2.325
fatcat:duruecqqdng3zf3vdvqlc7tyfa
*Typed**Lambda**Calculi**in*the Category*of**Finite*Vector Spaces 329 is call-by-value. ... We then*develop*an algebraic extension*of*the*finite**lambda*calculus and study two operational semantics: a call-by-name and a call-by-value. ... Modeling Simply-*Typed**Lambda**Calculi**in*the Category*of**Finite*Vector Spaces 359 At*type*A = B×C. ...##
###
Page 6421 of Mathematical Reviews Vol. , Issue 96k
[page]

1996
*
Mathematical Reviews
*

We begin by describing how infinite tableau

*developments*may be represented as co-inductive*types**in*such a theory. ... These*calculi*differ*in*the treatment*of*the substitutional properties*of*equivalences. ...##
###
Page 7145 of Mathematical Reviews Vol. , Issue 95m
[page]

1995
*
Mathematical Reviews
*

The strong normalization property

*of*the intersection*type*assignment system is used*in*order to prove the*finiteness**of**developments*property*of*the un-*typed**lambda*calculus*in*[J.-L. ... Summary: “We discuss some properties*of**typed**lambda**calculi*which can be related and applied to the proofs*of*some prop- erties*of*the untyped*lambda*calculus. ...##
###
Page 2858 of Mathematical Reviews Vol. , Issue 94e
[page]

1994
*
Mathematical Reviews
*

(English summary)

*Typed**lambda**calculi*and applications (Utrecht, 1993), 258-273, Lecture Notes*in*Comput. Sci., 664, Springer, Berlin, 1993. ... (English summary)*Typed**lambda**calculi*and applications (Utrecht, 1993), 328-345, Lecture Notes*in*Comput. Sci., 664, Springer, Berlin, 1993. ...##
###
Page 6736 of Mathematical Reviews Vol. , Issue 98K
[page]

1998
*
Mathematical Reviews
*

It is possible to represent data

*types**in*a very direct manner*in*various*lambda**calculi*. ...*In*this paper the decision problem*of*combinatory completeness for*finite*sets*of*proper combinators is studied for three subsystems*of*the pure*lambda*calculus. ...##
###
Page 1834 of Mathematical Reviews Vol. , Issue 94d
[page]

1994
*
Mathematical Reviews
*

Semantics

*of**lambda*-I and*of*other substructure*lambda**calculi*. ... Summary: “We present an algorithm for unification*in*the simply*typed**lambda*calculus which enumerates complete sets*of*uni- fiers using a*finitely*branching search space. ...##
###
Page 2535 of Mathematical Reviews Vol. , Issue 95e
[page]

1995
*
Mathematical Reviews
*

theories

*in**typed**lambda**calculi*. ... A great deal is known about the metatheory*of**typed**lambda**calculi*, but almost all*of*it concerns pure*type*theories. ...##
###
Strict Ideal Completions of the Lambda Calculus

2018
*
International Conference on Rewriting Techniques and Applications
*

*In*this paper we

*develop*a corresponding theory

*of*infinitary

*lambda*

*calculi*based on ideal completion instead

*of*metric completion. ... The infinitary

*lambda*

*calculi*pioneered by Kennaway et al. extend the basic

*lambda*calculus by metric completion to infinite terms and reductions. ... The Metric Completion

*In*this section, we introduce infinite

*lambda*terms as the result

*of*metric completion

*of*the set

*of*

*finite*

*lambda*terms. ...

##
###
Page 2188 of Mathematical Reviews Vol. , Issue 2000c
[page]

2000
*
Mathematical Reviews
*

cyclic

*lambda**calculi*. ... We*develop*the models*of*sharing graphs, also known as term graphs,*in*terms*of*both syntax and semantics. ...##
###
Computational Adequacy for Substructural Lambda Calculi
[article]

2020
*
arXiv
*
pre-print

Our categorical models are more

arXiv:2005.05433v1
fatcat:dunu4duwjvas3pvwzf77wujzmq
*general*than linear/non-linear models used to study linear logic and we present a homogeneous categorical account*of*both linear and affine*type*systems*in*a call-by-value ... Substructural*type*systems, such as affine (and linear)*type*systems, are*type*systems which impose restrictions on copying (and discarding)*of*variables, and they have found many applications*in*computer ... That is, variables*of*non-linear*type*may always be duplicated, but*in**general*, we do not allow copying*of*variables*of*arbitrary*types*(because such a*type*could be linear). ...
« Previous

*Showing results 1 — 15 out of 2,077 results*