Goal: This is just to collect the old work on xSLAM: Explicit Substitutions Linear Abstract Machines, available from https://www.cs.bham.ac.uk/research/projects/xslam/xslam.html
See also Project Linear Functional Programming https://www.researchgate.net/project/Linear-Functional-Programming
Some of the results of our research have been summarised in the following papers
1. E. Ritter. A calculus for Resource allocation.Technical Report, University of Birmingham, October 2000.
2. M.E. Maietti, V. de Paiva and E. Ritter. Linear primitive recursion. Technical Report, University of Padova, June 2000.
3. M.E. Maietti, V. de Paiva and E. Ritter. Categorical Models for Intuitionistic and Linear Type Theory.
In Proc. of FoSSaCS'00.
Lecture Notes of Computer Science.https://link.springer.com/content/pdf/10.1007/3-540-46432-8_15.pdf
4. I. Cervesato, V. de Paiva and E. Ritter. Explicit Substitutions for Linear Logical Frameworks.
In Proc. of the Workshop on
Logical Frameworks and Meta-Languages (LFM'99).
5. E. Ritter. Characterising Explicit Substitutions which Preserve Termination.
In Proc. of TLCA'99, LNCS 1581.
6. Explicit Substitutions for Constructive Necessity. N. Ghani, V. de Paiva, E. Ritter.
Proceedings of ICALP'98.
7. N. Ghani, V. de Paiva and E. Ritter. Categorical Models for Explicit Substitutions.
Presented at FoSSaCS'99.
https://www.researchgate.net/publication/2443561_Categorical_Models_of_Explicit_Substitutions
8. N. Ghani, V. de Paiva and E. Ritter. Linear Explicit Substitutions.
Journal of the IGPL, Vol. 8, No. 1.
also https://www.researchgate.net/publication/2741622_Linear_Explicit_Substitutions
9. An Abstract Machine based on Linear Logic and Explicit Substitutions.
Francisco Alberti. MSc in Advanced Computer Science,
University of Birmingham 1997.
10. Linear Explicit Substitutions (Extended Abstract).
N. Ghani, V. de Paiva, E. Ritter. Published in proceedings of WESTAPP'98.
11. On Explicit Substitutions and Names. V. de Paiva, E. Ritter.
Proceedings of ICALP'97.
Also Technical Report CSR-97-5 , School of Computer Science, University of Birmingham. March 1997.
https://www.researchgate.net/publication/2505679_On_Explicit_Substitutions_and_Names
12. Categorical Abstract Machines for Higher Order Typed Lambda-Calculi. E. Ritter.
In Theoretical Computer Science Volume 136, number 1,
pages 125 - 162, 1994.
13. Rewriting Properties of Combinators for Intuitionistic Linear Logic.
M. Nesi, V. de Paiva, E. Ritter.
Proceedings of the Workshop on Higher Order Algebra, Logic and Term Rewriting, HOA'93.
Lecture Notes in Computer Science, vol 816, Springer Verlag. 1994.
14. Relating Categorical Semantics for Intuitionistic Linear Logic.
P. Maneggia, M. Maietti, Valeria de Paiva and E. Ritter,
Invited at Natural Deduction 2001, Rio de Janeiro. Journal paper 2005,
https://link.springer.com/article/10.1007/s10485-004-3134-z
15. Normalization Bounds in Rudimentary Linear Logic M. Maietti, Valeria de Paiva and E. Ritter,
presented at the Workshop on Implicit Computational Complexity, FLoC'02, Copenhagen, 2002.
Also technical report of the University of Padova, Italy, 2002.
16. Variations on Linear PCF Valeria de Paiva and Eike Ritter, Proc. WESTAPP-99, 1999.
https://www.researchgate.net/publication/349324920_Variations_on_Linear_PCF
17. LLMS (commutative and non-commutative):
A Dialectica Model of State (1996) by Marcelo Correa , Edward Hauesler , Valeria de Paiva
(http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.4094)
Valeria de Paiva, Linear logic model of state revisited, Logic Journal of the IGPL,
Volume 22, Issue 5, October 2014, Pages 791–804, https://doi.org/10.1093/jigpal/jzu013
Recent slides set: https://www.slideshare.net/valeria.depaiva/categorical-semantics-for-explicit-substitutions