{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:19Z","timestamp":1761611299430},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617563"},{"type":"electronic","value":"9783540706540"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61756-6_93","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:20:26Z","timestamp":1330294826000},"page":"304-318","source":"Crossref","is-referenced-by-count":3,"title":["ProFun \u2014 A Language for executable specifications"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Gehrke","sequence":"first","affiliation":[]},{"given":"Michaela","family":"Huhn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Robert Amadio and Mads Dam. Towards a modal theory of types for the \u03c0-calculus. R96:03, SICS, 1996.","DOI":"10.1007\/3-540-61648-9_50"},{"key":"21_CR2","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/359576.359579","volume":"21","author":"J. Backus","year":"1978","unstructured":"J. Backus. Can programming be liberated from the von Neumann style? A functional style and its algebra of programs. Communications of the ACM, 21:613\u2013641, 1978.","journal-title":"Communications of the ACM"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten, editor. Applications of Process Algebra. Cambridge University Press, 1990.","DOI":"10.1017\/CBO9780511608841"},{"key":"21_CR4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0169-7552(87)90085-7","volume":"14","author":"T. Bolognesi","year":"1987","unstructured":"Tommaso Bolognesi and Ed Brinksma. Introduction to the ISO specification language LOTOS. Computer Networks and ISDN System, 14:25\u201359, 1987.","journal-title":"Computer Networks and ISDN System"},{"key":"21_CR5","unstructured":"Bell Laboratories,AT&T. Standard ML of New Jersey \u2014 User's Guide (Version 0.93), Feb 1993."},{"key":"21_CR6","unstructured":"G. Berry and G. Gonthier. The Esterel Synchronous Programming Language: Design, Semantics, Implementation. Technical report, ENSMP and INRIA, 1988."},{"key":"21_CR7","unstructured":"K. Bohlmann, R. Loogen, and Y. Ortega-Mall\u00e9n. Specification of Concurrent Process Systems in a Functional Setting. Technical report, Universit\u00e4t Marburg."},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"D. Clement. The Natural Dynamic Semantics of Mini-Standard ML. In E. Hartmut, R. Kowalski, and G. Levi, editors, TAPSOFT'87, volume 250 of LNCS, pages 67\u201381. Springer, 1987.","DOI":"10.1007\/BFb0014973"},{"key":"21_CR9","unstructured":"A.J. Field and P.G. Harrison. Functional Programming. Addison Wesley, 1988."},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"W. Ferreira and M. Hennessy. Towards a Semantic Theory of CML. Technical report, University of Sussex, 1995.","DOI":"10.1007\/3-540-60246-1_151"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"W. Ferreira, M. Hennessy, and A. Jeffrey. A Theory of Weak Bisimulation for Core CML. Technical Report 05\/95, University of Sussex, 1995.","DOI":"10.1145\/232627.232649"},{"key":"21_CR12","unstructured":"Thomas Gehrke. Eine Programmiersprache f\u00fcr verteilte Systeme mit funktionalem Datenanteil. Master's thesis, Universit\u00e4t Hildesheim, 1996."},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Thomas Gehrke and Michaela Huhn. ProFun \u2014 a Language for Executable Specifications. Technical Report HIB 17\/96, Universit\u00e4t Hildesheim, 1996.","DOI":"10.1007\/3-540-61756-6_93"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"J.F. Groote and H. Korver. A correctness proof of the bakery protocol in \u03bcCRL. In A. Ponse et al., editor, Algebra of Communicating Processes, Workshops in Computing, pages 63\u201386. Springer, 1994.","DOI":"10.1007\/978-1-4471-2120-6_3"},{"key":"21_CR15","unstructured":"J.F. Groote and A. Ponse. Proof theory for \u03bcCRL: a language for processes with data. Technical Report CS-R9138, CWI, 1991."},{"key":"21_CR16","unstructured":"R. Harper, D. MacQueen, and R. Milner. Standard ML. Technical Report ECS-LFCS-86-2, Dep. of Computer Science, University of Edinburgh, 1986."},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"21_CR18","unstructured":"ISO-OSI. LOTOS \u2014 A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour. DIS 8807, 1987."},{"key":"21_CR19","unstructured":"Xavier Leroy. The ZINC Experiment: An economical implementation of the ML language. Technical Report 117, Institut National de Recherche en Informatique et Automatique (INRIA), 1990."},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Rita Loogen. Parallele Implementierung funktionaler Programmiersprachen. Springer, 1990.","DOI":"10.1007\/978-3-642-75332-9"},{"key":"21_CR21","unstructured":"Robin Milner. Communication and Concurrency. Prentice Hall, 1989."},{"key":"21_CR22","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E. Moggi","year":"1991","unstructured":"Eugenio Moggi. Notions of computation and monads. Information and Computation, 93:55\u201392, 1991.","journal-title":"Information and Computation"},{"key":"21_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes. Information and Computation, 100:1\u201340, 41\u201377, 1992. parts I and II.","journal-title":"Information and Computation"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"Flemming Nielson and Hanne Riis Nielson. From CML to Process Algebras. In Proceedings of CONCUR '93, volume 715 of LNCS. Springer, 1993.","DOI":"10.1007\/3-540-57208-2_34"},{"key":"21_CR25","unstructured":"Charles Pecheur. A Proposal for Data Types for E-LOTOS. Technical report, University of Li\u00e8ge, 1994."},{"key":"21_CR26","unstructured":"Benjamin C. Pierce. Programming in the Pi-Calculus \u2014 An Experiment in Programming Language Design. Technical report, Department of Computer Science, University of Edinburgh, 1993."},{"key":"21_CR27","unstructured":"J.H. Reppy. CML: A Higher-order Concurrent Language. Technical report, Cornell University, 1993."},{"key":"21_CR28","unstructured":"B. Stroustrup. The C++ programming language. Addison-Wesley, 1992."},{"key":"21_CR29","unstructured":"Sun Microsystems GmbH. Multithreaded Programming Guide, 1994."},{"key":"21_CR30","volume-title":"Technical Report ECRC-93-20","author":"B. Thomsen","year":"1993","unstructured":"B. Thomsen et al. Facile Antigua Release Programming Guide. Technical Report ECRC-93-20, ECRC GmbH, M\u00fcnchen, 1993."}],"container-title":["Lecture Notes in Computer Science","Programming Languages: Implementations, Logics, and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61756-6_93.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T11:00:56Z","timestamp":1640948456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61756-6_93"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617563","9783540706540"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-61756-6_93","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}