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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
  • 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
2000
2000
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
Les systemes communicants mettent en jeu des objets potentiellement infinis (boucles d'interaction, listes de donnees infinies… 
Highly Cited
1994
Highly Cited
1994
  • 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
  • P. Mulry
  • Theoretical Computer Science
  • 1994
  • Corpus ID: 46529009
Highly Cited
1993
Highly Cited
1993
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
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
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