Abstract
We propose first steps towards an extension of interaction nets for handling functions with side effects via monads.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Fernández, M.: Type assignment and termination of interaction nets. Mathematical Structures in Computer Science 8(6), 593–636 (1998)
Hassan, A., Jiresch, E., Sato, S.: An implementation of nested pattern matching in interaction nets. EPTCS 21, 13–25 (2010)
Kircher, F., Munoz, C.: The proof monad. Journal of Logic and Algebraic Programming 79, 264–277 (2010)
Lafont, Y.: Interaction nets. In: Proceedings, 17th ACM Symposium on Principles of Programming Languages, pp. 95–108 (1990)
Wadler, P.: How to declare an imperative. ACM Comp. Surv. 29(3), 240–263 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiresch, E. (2010). Realizing Impure Functions in Interaction Nets. In: Ehrig, H., Rensink, A., Rozenberg, G., Schürr, A. (eds) Graph Transformations. ICGT 2010. Lecture Notes in Computer Science, vol 6372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15928-2_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-15928-2_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15927-5
Online ISBN: 978-3-642-15928-2
eBook Packages: Computer ScienceComputer Science (R0)