Recursion versus non-recursion in Pascal: recursion can be faster. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/journals/sigplan/Louden87>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Kenneth_C._Louden>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1145%2F24686.24691>
foaf:homepage	<https://doi.org/10.1145/24686.24691>
dc:identifier	DBLP journals/sigplan/Louden87 (xsd:string)
dc:identifier	DOI doi.org%2F10.1145%2F24686.24691 (xsd:string)
dcterms:issued	1987 (xsd:gYear)
swrc:journal	<https://dblp.l3s.de/d2r/resource/journals/sigplan>
rdfs:label	Recursion versus non-recursion in Pascal: recursion can be faster. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Kenneth_C._Louden>
swrc:number	2 (xsd:string)
swrc:pages	62-67 (xsd:string)
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/journals/sigplan/Louden87/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/journals/sigplan/Louden87>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/journals/sigplan/sigplan22.html#Louden87>
rdfs:seeAlso	<https://doi.org/10.1145/24686.24691>
dc:title	Recursion versus non-recursion in Pascal: recursion can be faster. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:Article
rdf:type	foaf:Document
swrc:volume	22 (xsd:string)