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
Is this relevant?
2017
2017
An optimal parameters design methodology of series-series resonant tank of wireless power transmission system for battery charging
Compared with traditional plug-in charging method, wireless power transmission (WPT) has more convenience and security. In this… Expand
  • figure 1
  • figure 2
  • figure 3
  • table II
  • table I
Is this relevant?
2016
2016
years of oral lipid-based formulations : Provenance , progress and future perspectives ☆
a Drug Delivery, Disposition and Dynamics, Monash Institute of Pharmaceutical Sciences, Monash University, 381 Royal Parade… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
Almost Optimal Strategies in One Clock Priced Timed Automata
 
Is this relevant?
2002
2002
Performance modelling with UML and stochastic process algebras
We describe a software toolset which allows UML modellers to annotate their models with performance information. An equivalent… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 9
Is this relevant?
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
Is this relevant?
1996
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
Is this relevant?
1994
1994
Partial Map Classifiers and Partial Cartesian Closed Categories
Abstract In this paper we consider two conceptually different categorical approaches to partiality namely partial map classifiers… Expand
Is this relevant?
1993
1993
Closure Under Alpha-Conversion
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
Is this relevant?
1993
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
Is this relevant?
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