Last update: Sun Oct 15 02:56:11 MDT 2017
@Article{Brock:1998:PSF, author = "S. Brock and G. Ostheimer", title = "A process semantics for functional programming", journal = j-THEOR-COMP-SCI, volume = "194", number = "1--2", pages = "241--??", day = "10", month = mar, year = "1998", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Wed May 27 07:21:35 MDT 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib", acknowledgement = ack-nhfb, classification = "C4210L (Formal languages and computational linguistics); C6110 (Systems analysis and programming)", conflocation = "Pisa, Italy; 28 Aug.-1 Sept. 1995", conftitle = "Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA '95) (papers in summary form only received)", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational linguistics; cycles; functional languages; functional programming; graph grammars; graph semantics; lazy functional programming languages; process algebra; process semantics; strictness; tree semantics", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", xxnote = "Check page numbers: duplicate in adjacent entries", }