TY - GEN
T1 - VMλ
T2 - 6th Fuji International Symposium on Functional and Logic Programming, FLOPS 2002
AU - Sumii, Eijiro
AU - Bannai, Hideo
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.
PY - 2002
Y1 - 2002
N2 - We present VMλ, a formalization and implementation of the functional language VML. VML is a programming language proposed by discovery scientists for the purpose of assisting the process of knowledge discovery. It is a non-trivial extension of ML with hypothetical views. Operationally, a hypothetical view is a value with a representation that indicates how the value was created. The notion of hypothetical views has already been successful in the domain of genome analysis, and known to be useful in the process of knowledge discovery. However, VML as a programming language was only informally defined in English prose, and indeed found problematic both in theory and in practice. Thus, a proper definition and implementation of VML with formal foundations would be of great help to discovery science and hence corresponding domain sciences. This paper gives a solid foundation of VML by extending the standard simply typed call-by-value λ-calculus. Although this extension, VMλ, is simple and clear, its design required much care to find and fix problems of the original VML.We also present a real implementation of VMλ, written in Camlp4 as a conservative translator into OCaml. This implementation makes extensive use of labeled arguments and polymorphic variants – two advanced features of OCaml that originate in OLabl.
AB - We present VMλ, a formalization and implementation of the functional language VML. VML is a programming language proposed by discovery scientists for the purpose of assisting the process of knowledge discovery. It is a non-trivial extension of ML with hypothetical views. Operationally, a hypothetical view is a value with a representation that indicates how the value was created. The notion of hypothetical views has already been successful in the domain of genome analysis, and known to be useful in the process of knowledge discovery. However, VML as a programming language was only informally defined in English prose, and indeed found problematic both in theory and in practice. Thus, a proper definition and implementation of VML with formal foundations would be of great help to discovery science and hence corresponding domain sciences. This paper gives a solid foundation of VML by extending the standard simply typed call-by-value λ-calculus. Although this extension, VMλ, is simple and clear, its design required much care to find and fix problems of the original VML.We also present a real implementation of VMλ, written in Camlp4 as a conservative translator into OCaml. This implementation makes extensive use of labeled arguments and polymorphic variants – two advanced features of OCaml that originate in OLabl.
UR - http://www.scopus.com/inward/record.url?scp=84957027719&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84957027719&partnerID=8YFLogxK
U2 - 10.1007/3-540-45788-7
DO - 10.1007/3-540-45788-7
M3 - Conference contribution
AN - SCOPUS:84957027719
SN - 3540442332
SN - 9783540442332
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 290
EP - 304
BT - Functional and Logic Programming - 6th International Symposium, FLOPS 2002, Proceedings
A2 - Hu, Zhenjiang
A2 - Rodriguez-Artalejo, Mario
PB - Springer Verlag
Y2 - 15 September 2002 through 17 September 2002
ER -