Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
Andrew D. GordonChris ToftsDavide SangiorgiDon Sannella

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… 
Highly Cited
2005
Highly Cited
2005
On Intuitionistic Linear Logic
2000
2000
A de Bruijn Notation for Higher-Order Rewriting
We propose a formalism for higher-order rewriting in de Bruijn notation. This notation not only is used for terms (as usually… 
Highly Cited
1996
Highly Cited
1996
Un calcul de constructions infinies et son application a la verification de systemes communicants
Les systemes communicants mettent en jeu des objets potentiellement infinis (boucles d'interaction, listes de donnees infinies… 
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… 
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
Within the framework of categorical logic/type theory, we provide a category-theoretic account of some logical concepts, i.e… 
Highly Cited
1992
Highly Cited
1992
Polymorphic typing of an algorithmic language
The polymorphic type discipline, as in the ML language, fits well within purely applicative languages, but does not extend… 
Highly Cited
1992
Highly Cited
1992
Calculus of Mobile Processes
We present the a-calculus, a calculus of communicating systems in which one can naturally express processes which have changing… 
Highly Cited
1992
Highly Cited
1992
A Calculus of Mobile Processes, II
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)