Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Related topics

Related topics

6 relations
Andrew D. GordonChris ToftsDavide SangiorgiDon Sannella
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Control de Micro-Redes de Energía Renovable a través de estructuras LFCS Reconfigurables en VHDL
Esta investigacion presenta el diseno de un control basado en arquitectura LFCS (Linear Feedback Concurrent Structure), sobre… Expand
Highly Cited
2004
Highly Cited
2004
Toward formal development of programs from algebraic specifications: Implementations revisited
SummaryThe program development process is viewed as a sequence of implementation steps leading from a specification to a program… Expand
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… Expand
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… Expand
Highly Cited
1996
Highly Cited
1996
Normalisation in lambda calculus and its relation to type inference
rewriting system, 16 irreflexive, 33 weakly irreflexive, 33 with typing, 37, 40 with very weak typing, 40 with weak typing, 40… Expand
  • table 10.1
  • table 12.1
  • table 13.1
  • table 13.2
1994
1994
Partial Map Classifiers and Partial Cartesian Closed Categories
  • P. Mulry
  • Theor. Comput. Sci.
  • 1994
    • Corpus ID: 46529009
Abstract In this paper we consider two conceptually different categorical approaches to partiality namely partial map classifiers… Expand
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… Expand
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… Expand
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… Expand
  • figure 1
  • figure 2
  • figure 3
Highly Cited
1992
Highly Cited
1992
A calculus of mobile processes, II
We present the a-calculus, a calculus of communicating systems in which one can naturally express processes which have changing… Expand
  • figure 1
  • figure 2
  • figure 3
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE