# Simply typed lambda calculus

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- ArXiv
- 2014

We define a simply typed, non-deterministic lambda-calculus where isomorphic types are equated. To this end, an equivalence… (More)

Is this relevant?

2013

2013

- ICALP
- 2013

This paper concerns retracts in simply typed lambda calculus assuming βη-equality. We provide a simple tableau proof system which… (More)

Is this relevant?

2012

2012

- RTA
- 2012

Consider the following problem: given a simply typed lambda term of Boolean type and of order r, does it normalize to “true”? A… (More)

Is this relevant?

2011

2011

- LFMTP
- 2011

We investigate a class of nominal algebraic Henkin-style models for the simply typed λ calculus in which variables map to names… (More)

Is this relevant?

2008

2008

- Logical Methods in Computer Science
- 2008

Tse and Zdancewic have formalized the notion of noninterference for Abadi et al.’s DCC in terms of logical relations and given a… (More)

Is this relevant?

2006

2006

- ASIAN
- 2006

Tse and Zdancewic have formalized the notion of noninterference for Abadi et al.’s DCC in terms of logical relations and given a… (More)

Is this relevant?

2006

2006

- 2006

In this paper we present a formalization of the simply typed lambda calculus with constants and with typing à la Church. It has… (More)

Is this relevant?

2005

2005

- FCT
- 2005

We consider terms of simply typed lambda calculus in which copy of a subterm may not be inserted to the argument of itself during… (More)

Is this relevant?

1999

1999

- Arch. Math. Log.
- 1999

Inductive characterizations of the sets of terms, the subset of strongly normalizing terms and normal forms are studied in order… (More)

Is this relevant?

1995

1995

- TLCA
- 1995

We investigate, in a categorical setting, some completeness properties of beta-eta conversion between closed terms of the simply… (More)

Is this relevant?