Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 210,177,944 papers from all fields of science

Search

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

2017

2017

Many language designers have adopted gradual typing. However, there remains open questions regarding how to gradualize languages…

2016

2016

In a world where trusting software systems is increasingly important, formal methods and formal proof can help provide some basis…

2015

2015

We present a new interpreter for $$\lambda $$Prolog that runs consistently faster than the byte code compiled by Teyjus, that is…

Highly Cited

1999

Highly Cited

1999

Higher-order, typed logic programming languages such as lambda-Prolog and Twelf have emerged in this last decade as the solution…

Highly Cited

1996

Highly Cited

1996

Highly Cited

1991

Highly Cited

1991

The unification of simply typed ‚-terms modulo the rules of fl- and ·-conversions is often called “higher-order” unification…

Highly Cited

1989

Highly Cited

1989

A description is given of Elf, a metalanguage for proof manipulation environments that are independent of any particular logical…

Highly Cited

1988

Highly Cited

1988

We show that the problem of partial type inference in the nth-order polymorphic &lgr;-calculus is equivalent to nth-order…

Highly Cited

1987

Highly Cited

1987

By permitting function and predicate symbols to be variables and by replacing first-order terms by simply typed $lambda$-terms, a…