Â

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

2009

2009

- Andrei Popescu
- 2009

We develop some Higher-Order Abstract Syntax (HOAS) concepts and proof principles as a collection of definitions and propositionsâ€¦Â (More)

Is this relevant?

2008

2008

- Colin Riba
- 2008

Reducibility is a powerful proof method which applies to various properties of typed terms in different type systems. For strongâ€¦Â (More)

Is this relevant?

2005

2005

We study extensional models of the untyped lambda calculus in the setting of the game semantics introduced by Abramsky, Hyland etâ€¦Â (More)

Is this relevant?

2004

2004

Among all the reduction strategies for the untyped Î»-calculus, the so called lazy Î²-evaluation is of particular interest due toâ€¦Â (More)

Is this relevant?

2000

2000

- John Longley
- 2000

Realizability interpretations of logics are given by saying what it means for computational objects of some kind to realizeâ€¦Â (More)

Is this relevant?

1999

1999

- Torben Mogensen Diku
- 1999

It is well-known that one cannot inside the pure untyped lambda calculus determine equivalence. I.e., one cannot determine if twoâ€¦Â (More)

Is this relevant?

1999

1999

ions over hole variables, hole lling simply boils down to (multiple) -reduction. So, in our running example we get ( h: x:x( h xâ€¦Â (More)

Is this relevant?

1998

1998

We study extensional models of the untyped lambda calculus in the setting of game semantics. In particular, we show thatâ€¦Â (More)

Is this relevant?

1997

1997

- Jean H. Gallier
- 1997

It was observed by Curry that when (untyped) Î» -terms can be assigned types,for example,simple types,these terms have niceâ€¦Â (More)

Is this relevant?

1991