Computational lambda-calculus and monads Export

@inproceedings{citeulike:341213, abstract = {The \λ-calculus is considered a useful mathematical tool in the study of programming languages. However, if one uses \β\η-conversion to prove equivalence of programs, then a gross simplification is introduced. The author gives a calculus based on a categorical semantics for computations, which provides a correct basis for proving equivalence of programs, independent from any specific computational model}, author = {Moggi, E.}, citeulike-article-id = {341213}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/LICS.1989.39155}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=39155}, doi = {10.1109/LICS.1989.39155}, journal = {Logic in Computer Science, 1989. LICS '89, Proceedings., Fourth Annual Symposium on}, keywords = {calculus, lambda, monads}, pages = {14--23}, posted-at = {2006-08-18 12:06:17}, priority = {5}, title = {Computational lambda-calculus and monads}, url = {http://dx.doi.org/10.1109/LICS.1989.39155}, year = {1989} }

TY - CONF ID - citeulike:341213 L3 - citeulike-article-id:341213 N2 - The λ-calculus is considered a useful mathematical tool in the study of programming languages. However, if one uses βη-conversion to prove equivalence of programs, then a gross simplification is introduced. The author gives a calculus based on a categorical semantics for computations, which provides a correct basis for proving equivalence of programs, independent from any specific computational model JF - Logic in Computer Science, 1989. LICS '89, Proceedings., Fourth Annual Symposium on EP - 23 TI - Computational lambda-calculus and monads SP - 14 KW - calculus KW - lambda KW - monads AU - Moggi, E PY - 1989/// UR - http://dx.doi.org/10.1109/LICS.1989.39155 ER -