Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 209,922,981 papers from all fields of science
Search
Sign In
Create Free Account
Laboratory for Foundations of Computer Science
Known as:
LFCS
The Laboratory for Foundations of Computer Science (LFCS) is a research institute within the School of Informatics at the University of Edinburgh, in…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Andrew D. Gordon
Chris Tofts
Davide Sangiorgi
Don Sannella
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Constructing Applicative Functors
R. Paterson
International Conference on Mathematics of…
2012
Corpus ID: 38706137
Applicative functors define an interface to computation that is more general, and correspondingly weaker, than that of monads…
Expand
Highly Cited
2005
Highly Cited
2005
On Intuitionistic Linear Logic
G. Bierman
,
Torben Brauner
,
P. Curzon
,
Francis Davey
2005
Corpus ID: 118739437
2000
2000
A de Bruijn Notation for Higher-Order Rewriting
E. Bonelli
,
D. Kesner
,
Alejandro Ríos
International Conference on Rewriting Techniques…
2000
Corpus ID: 15841765
We propose a formalism for higher-order rewriting in de Bruijn notation. This notation not only is used for terms (as usually…
Expand
Highly Cited
1996
Highly Cited
1996
Un calcul de constructions infinies et son application a la verification de systemes communicants
E. Gimenez
1996
Corpus ID: 171050903
Les systemes communicants mettent en jeu des objets potentiellement infinis (boucles d'interaction, listes de donnees infinies…
Expand
Highly Cited
1994
Highly Cited
1994
Closure Under Alpha-Conversion
R. Pollack
Types for Proofs and Programs
1994
Corpus ID: 18913822
ion, compute a type for its body in an extended context; to compute a type for an application, compute types for its left and…
Expand
1994
1994
Partial Map Classifiers and Partial Cartesian Closed Categories
P. Mulry
Theoretical Computer Science
1994
Corpus ID: 46529009
Highly Cited
1993
Highly Cited
1993
Fibrations, logical predicates and indeterminates
C. Hermida
CST
1993
Corpus ID: 122505884
Within the framework of categorical logic/type theory, we provide a category-theoretic account of some logical concepts, i.e…
Expand
Highly Cited
1992
Highly Cited
1992
Polymorphic typing of an algorithmic language
X. Leroy
1992
Corpus ID: 59702693
The polymorphic type discipline, as in the ML language, fits well within purely applicative languages, but does not extend…
Expand
Highly Cited
1992
Highly Cited
1992
Calculus of Mobile Processes
R. Milner
,
J. Parrow
,
D. Walker
Encyclopedia of Parallel Computing
1992
Corpus ID: 31508937
We present the a-calculus, a calculus of communicating systems in which one can naturally express processes which have changing…
Expand
Highly Cited
1992
Highly Cited
1992
A Calculus of Mobile Processes, II
R. Milner
,
J. Parrow
,
D. Walker
Information and Computation
1992
Corpus ID: 39498365
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE