Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

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

2010

2010

If we represent a λ-calculus term as a DAG rather than a tree, we can efficiently represent the sharing that arises from… Expand

Is this relevant?

2008

2008

$\X$ is an untyped continuation-style formal language with a typed subset that provides a Curry–Howard isomorphism for a sequent… Expand

Is this relevant?

2007

2007

Typing of lambda-terms in elementary and light affine logic (EAL , LAL resp.) has been studied for two different reasons: on the… Expand

Is this relevant?

2005

2005

A debugger is a tool that allows the programmer to view some aspect of the running program. This paper will present a… Expand

Is this relevant?

2002

2002

Marcelo Dascal destaca en diversos articulos en los que analiza las consecuencias de la concepcion pragmatica del significado, la… Expand

Is this relevant?

2001

2001

Abstract Great strides have been made in recent years in the theory and practice of propositional satisfiability testing. On the… Expand

Is this relevant?

1997

1997

In this thesis we present two applications of using types of a typed lambda calculus to derive equation schemas, instances of… Expand

Is this relevant?

Highly Cited

1995

Highly Cited

1995

Abadi and Cardelli have recently investigated a calculus of objects [2]. The calculus supports a key feature of object-oriented… Expand

Is this relevant?

1994

1994

Church''s simply typed lambda-calculus is a very basic framework for functional programming language research. However, it is… Expand

Is this relevant?

1990

1990

We carry out an analysis of typability of terms in ML. Our main result is that this problem is DEXPTIME-hard, where by DEXPTIME… Expand

Is this relevant?