• Publications
  • Influence
The information theory approach to communications
  • 196
  • 22
Set-theoretical models of λ-calculus: theories, expansions, isomorphisms
  • G. Longo
  • Mathematics, Computer Science
  • Ann. Pure Appl. Log.
  • 1 August 1983
On introduit les termes du logique combinatoire d'ordres divers, correspondant aux niveaux de fonctionnalite ou au nombre de λ-abstractions. Expand
  • 136
  • 13
  • PDF
A calculus for overloaded functions with subtyping
We present a simple extension of typed λ-claculus where functions can be overloaded by adding different “pieces of code”. Expand
  • 180
  • 12
  • PDF
Provable Isomorphisms of Types
A constructive characterization is given of the isomorphisms which must hold in all models of the typed lambda calculus with surjective pairing. Expand
  • 100
  • 9
  • PDF
Categories, types and structures - an introduction to category theory for the working computer scientist
Category theory is a mathematical subject whose importance in several areas of computer science, most notably the semantics of programming languages and the design of programmes using abstract data types, is widely acknowledged. Expand
  • 282
  • 8
  • PDF
Lambda-Calculus Models and Extensionality
  • 128
  • 7
Extended Type Structures and Filter Lambda Models
An Extended Abstract Type Structure is a pre-ordered set X which includes a largestelement and a b, a b, whenever a, b are in X. Extended Type Structures (ETS may be given over applicativeExpand
  • 154
  • 7
The error exponent for the noiseless encoding of finite ergodic Markov sources
A new approach to the classical fixed-length noiseless source coding problem is proposed for the case of finite ergodic Markov sources, based on simple counting arguments. Expand
  • 90
  • 7
Constructive Natural Deduction and its 'Omega-Set' Interpretation
  • G. Longo, E. Moggi
  • Mathematics, Computer Science
  • Math. Struct. Comput. Sci.
  • 1 July 1991
Various Theories of Types are introduced, by stressing the analogy "propositions- as-types" : from propositional to higher order types (and Logic). Expand
  • 84
  • 6
A Noiseless Coding Theorem for Sources Having Utilities
An investigation is carried out concerning discrete memoryless sources possessing an additional parameter (utility) which seems to be significant in problems of storage and transmission. A costExpand
  • 51
  • 6