Back to Results
First PageMeta Content
Computability theory / Recursion / Theoretical computer science / Models of computation / Formal methods / Lambda calculus / Standard ML / Free variables and bound variables / Scheme / Software engineering / Computing / Mathematics


Higher-Order and Symbolic Computation manuscript No. (will be inserted by the editor) Compilation of extended recursion in call-by-value functional languages Tom Hirschowitz · Xavier Leroy · J. B. Wells
Add to Reading List

Document Date: 2009-12-15 04:49:16

Open Document

File Size: 609,80 KB

Share Result on Facebook

City

Edinburgh / /

Company

Computer Sciences / /

Country

United Kingdom / France / /

/

Facility

University of Savoie / Campus Scientifique / Heriot-Watt University / /

IndustryTerm

constructor applications / enriched type systems / /

Organization

University of Savoie / Tom Hirschowitz Department of Mathematics / Heriot-Watt University / J. B. Wells School of Mathematical / /

Person

Xavier Leroy / Tom Hirschowitz / /

Position

editor / /

ProgrammingLanguage

Haskell / C / Standard ML / A # / /

Technology

dom / /

SocialTag