People
Events
Research
Home
LFCS reports by Author: L
Laird, James David
A Semantic analysis of control
James David Laird
LFCS report ECS-LFCS-99-409
Lange, Martin
Games for Modal and Temporal Logics
Martin Lange
Larsen, Kim
Context-Dependent Bisimulation between Processes
K. Larsen
LFCS report ECS-LFCS-86-4 (also published as CST-37-86)
A Complete Protocol Verification using Relativized Bisimulation
K. Larsen and R. Milner
LFCS report ECS-LFCS-86-13
Lengauer, Chris
A Systolic Array for Pyramidal Algorithms
C. Lengauer and J. Xue
LFCS report ECS-LFCS-90-114
On the Description and Development of One-Dimensional Systolic Arrays
C Lengauer and J. Xue
LFCS report ECS-LFCS-90-116
A Systolizing Compilation Scheme
C. Lengauer and M. Barnett
LFCS report ECS-LFCS-91-134
The Systematic derivation of Control Signals for Systolic Arrays
C Lengauer and J Xue
LFCS report ECS-LFCS-91-152
An Improved Systolic Array for String Correction
C Lengauer and D Sangiorgi
LFCS report ECS-LFCS-91-153
The Synthesis of Control Signals for One-Dimensional Systolic Arrays
J Xue and C Lengauer
LFCS report ECS-LFCS-91-156
Recent Developments in Systolic Design
C. Lengauer and J. Xue
LFCS report ECS-LFCS-91-176
Loop Parallelization and Unimodularity
C. Lengauer and M. Barnett
LFCS report ECS-LFCS-92-197
Lenisa, Marina
Fully Complete Models for ML Polymorphic Types
Samson Abramsky and Marina Lenisa
LFCS report ECS-LFCS-99-414
Ling, Budi
Applicative Notions in ML-like Programs
Budi Halim Ling
LFCS report ECS-LFCS-98-390
Loader, Ralph
Notes on Simply Typed Lambda Calculus
Ralph Loader
LFCS report ECS-LFCS-98-381
Longley, John R
Realizability Toposes and Language Semantics
John R. Longley
LFCS report ECS-LFCS-95-332
Partial Functions in a Total Setting
Simon Finn, Michael Fourman and John Longley
LFCS report ECS-LFCS-96-341
Logical Full Abstraction and PCF
John Longley and Gordon Plotkin
LFCS report ECS-LFCS-97-353
The sequentially realizable functionals
John Longley
LFCS report ECS-LFCS-98-402
Luo, Zhaohui
A Higher-order Calculus and Theory Abstraction
Zhaohui Luo
LFCS report ECS-LFCS-88-57
CC and its Meta Theory
Zhaohui Luo
LFCS report ECS-LFCS-88-58
An Extended Calculus of Constructions
Zhaohui Luo
LFCS report ECS-LFCS-90-118 (also published as CST-65-90)
A Problem of Adequacy: conservativity of calculus of constructions over higher-order logic
Zhaohui Luo
LFCS report ECS-LFCS-90-121
Program Specification and Data Refinement in Type Theory
Zhaohui Luo
LFCS report ECS-LFCS-91-131
A Unifying theory of Dependent Types I
Z. Luo
LFCS report ECS-LFCS-91-154
A Unifying Theory of Dependent Types: the Schematic Approach
Zhaohui Luo
LFCS report ECS-LFCS-92-202
A Set-theoretic Setting for Structuring Theories in Proof Development
Z. Luo and R. Burstall
LFCS report ECS-LFCS-92-206
Inductive Data Types: Well-ordering Types Revisited
H. Goguen and Zhaohui Luo
LFCS report ECS-LFCS-92-209
LEGO Proof Development System: User's Manual
Zhaohui Luo and R Pollack
LFCS report ECS-LFCS-92-211
Lüth, Christoph
Categorical Term Rewriting: Monads and Modularity
Christoph Lüth
LFCS report ECS-LFCS-98-396
Previous
|
Index
|
Next