ComputingComputer ScienceMathematicsFormal MethodsLogicTheory Of ComputationAbstract InterpretationCategory TheoryModel TheoryCompletenessLogical CompletenessModel Completeness
I give a 'totality space' model for linear logic [4] derived by taking an abstract view of computations on a datatype. The model has similarities with both the coherence space model and game-theoretic models, but is based upon a notion of total object. Using this model, I prove a full completeness result. In other words, I show that the mapping of proofs to their interpretations (here collections of total objects uniform for a given functor) in the model is a surjection.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
4
Jean-Yves Girard · Theoretical Computer Science · 1987 · 4.1K citations
The system F of variable types, fifteen years later
Jean-Yves Girard · Theoretical Computer Science · 1986 · 356 citations
The structure of multiplicatives
Vincent Danos, Laurent Régnier · Archive for Mathematical Logic · 1989 · 347 citations