Closed Freyd- and kappa-categories

@inproceedings{Power1999ClosedFA,
  title={Closed Freyd- and kappa-categories},
  author={J. Power and Hayo Thielecke},
  booktitle={ICALP},
  year={1999}
}
We give two classes of sound and complete models for the computational λ-calculus, or λc-calculus. For the first, we generalise the notion of cartesian closed category to that of closed Freyd-category. For the second, we generalise simple indexed categories. The former gives a direct semantics for the computational λ-calculus. The latter corresponds to an idealisation of stack-based intermediate languages used in some approaches to compiling. 
Models for the computational lambda-calculus
  • J. Power
  • Computer Science, Mathematics
  • Electron. Notes Theor. Comput. Sci.
  • 2000
Direct Models for the Computational Lambda Calculus
Cartesian effect categories are Freyd-categories
Modelling environments in call-by-value programming languages
Adequacy for Algebraic Effects
From Linear Logic to Cyclic Sharing
On the call-by-value CPS transform and its semantics
Linearly-Used State in Models of Call-by-Value
Parameterised notions of computation
  • R. Atkey
  • Mathematics, Computer Science
  • J. Funct. Program.
  • 2009
...
1
2
3
4
5
...

References

SHOWING 1-9 OF 9 REFERENCES
Computational lambda-calculus and monads
  • E. Moggi
  • Mathematics, Computer Science
  • [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science
  • 1989
Notions of Computation and Monads
  • E. Moggi
  • Computer Science, Mathematics
  • Inf. Comput.
  • 1991
Decomposing Typed Lambda Calculus into a Couple of Categorical Programming Languages
  • Masahito Hasegawa
  • Mathematics, Computer Science
  • Category Theory and Computer Science
  • 1995
Premonoidal Categories and Notions of Computation
Call-by-Push-Value: A Subsuming Paradigm
A Taxonomy of Functional Language Implementations : Part I : Call by Value
The ZINC experiment : an economical implementation of the ML language