ML
ML (’Meta Language’) is a general-purpose functional programming language. It has roots in Lisp, and has been characterized as ”Lisp with types”. It is known for its use of the polymorphic Hindley–Milner type system, which automatically assigns the types of most expressions without requiring explicit type annotations, and ensures type safety – there is a formal proof that a well-typed ML program does not cause runtime type errors.[1] ML provides pattern matching for function arguments, garbage collection, imperative programming, call-by-value and currying. It is used heavily in programming language research and is one of the few languages to be completely specified and verified using formal semantics. Its types and pattern matching make it well-suited and commonly used to operate on other formal languages, such as in compiler writing, automated theorem proving and formal verification. (wikipedia)
Keywords for this software
References in zbMATH (referenced in 478 articles , 4 standard articles )
Showing results 1 to 20 of 478.
Sorted by year (- Jay, Barry: Intensional computation with higher-order functions (2019)
- Kunčar, Ondřej; Popescu, Andrei: From types to sets by local type definition in higher-order logic (2019)
- Blanqui, Frédéric: Size-based termination of higher-order rewriting (2018)
- Farka, František; Komendantskya, Ekaterina; Hammond, Kevin: Proof-relevant Horn clauses for dependent type inference and term synthesis (2018)
- Farmer, William M.: Incorporating quotation and evaluation into Church’s type theory (2018)
- Harper, Robert: Exception tracking in an open world (2018)
- Melham, Tom: Symbolic trajectory evaluation (2018)
- Paulson, Lawrence C.: Computational logic: its origins and applications (2018)
- Rossberg, Andreas: 1ML -- core and modules united (2018)
- Shankar, Natarajan: Combining model checking and deduction (2018)
- Shi, Ling; Zhao, Yongxin; Liu, Yang; Sun, Jun; Dong, Jin Song; Qin, Shengchao: A UTP semantics for communicating processes with shared variables and its formal encoding in PVS (2018)
- Shi, Zhiping; Wu, Aixuan; Yang, Xiumei; Guan, Yong; Li, Yongdong; Song, Xiaoyu: Formal analysis of the kinematic Jacobian in screw theory (2018)
- Berger, Ulrich; Hou, Tie: A realizability interpretation of Church’s simple theory of types (2017)
- Blanchette, Jasmin Christian; Bouzy, Aymeric; Lochbihler, Andreas; Popescu, Andrei; Traytel, Dmitriy: Friends with benefits. Implementing corecursion in foundational proof assistants (2017)
- Blanchette, Jasmin Christian; Popescu, Andrei; Traytel, Dmitriy: Soundness and completeness proofs by coinductive methods (2017)
- Chihani, Zakaria; Miller, Dale; Renaud, Fabien: A semantic framework for proof evidence (2017)
- Crary, Karl: Modules, abstraction, and parametric polymorphism (2017)
- Farmer, William M.: Theory morphisms in Church’s type theory with quotation and evaluation (2017)
- Frohn, Florian; Giesl, Jürgen; Hensel, Jera; Aschermann, Cornelius; Ströder, Thomas: Lower bounds for runtime complexity of term rewriting (2017)
- Hou (Favonia), Kuen-Bang; Benton, Nick; Harper, Robert: Correctness of compiling polymorphism to dynamic typing (2017)