Sign In

Login

Password

Forgot Password ? Sign Up

ML语言 (Chinese Wikipedia)

Analysis of information sources in references of the Wikipedia article "ML语言" in Chinese language version.

refsWebsite
Global rank Chinese rank
54web.archive.org
1st place
1st place
12wikipedia.org
low place
low place
9inria.fr
4,903rd place
7,274th place
7smlfamily.github.io
low place
low place
5ed.ac.uk
1,871st place
2,278th place
4cam.ac.uk
670th place
845th place
3psu.edu
207th place
628th place
3researchgate.net
120th place
337th place
3cmu.edu
1,564th place
1,640th place
2cornell.edu
332nd place
526th place
1epdf.pub
low place
low place
1it-sudparis.eu
low place
low place
1r-5.org
low place
low place
1futhark-lang.org
low place
low place
1oup.com
485th place
489th place
1nemerle.org
low place
low place
1chlipala.net
low place
low place
1nuprl.org
low place
low place
1launchpad.net
low place
low place
1chalmers.se
low place
low place
1lucacardelli.name
low place
low place
1smlnj.org
low place
low place
1sciencedirect.com
149th place
292nd place
1mauny.net
low place
low place
1jstor.org
26th place
113th place
1archive.org
6th place
4th place
1utexas.edu
916th place
1,065th place
1kent.ac.uk
6,512th place
8,433rd place
1wikisource.org
27th place
30th place
1polsl.pl
low place
low place
1uchile.cl
2,951st place
low place
1mlton.org
low place
low place
1mpi-sws.org
low place
low place
1ocaml.org
low place
low place
1uni-saarland.de
low place
low place
1amulet.works
low place
low place
1github.com
383rd place
336th place

amulet.works

archive.org

cam.ac.uk

cl.cam.ac.uk

  • Michael J. Gordon, Arthur J. Milner, Christopher P. Wadsworth. Edinburgh LCF: A Mechanised Logic of Computation. Lecture Notes in Computer Science, Vol. 78. Springer-Verlag, New York, NY, USA. 1979 [2021-12-28]. （原始内容存档于2021-12-28）. ML is a general purpose programming language. It is derived in different aspects from ISWIM, POP2 and GEDANKEN, and contains perhaps two new features. First, it has an escape and escape trapping mechanism, well-adapted to programming strategies which may be (in fact usually are) inapplicable to certain goals. Second, it has a polymorphic type discipline which combines the flexibility of programming in a typeless language with the security of compile-time type checking (as in other languages, you may also define your own types, which may be abstract and/or recursive); this is what ensures that a well-typed program cannot perform faulty proofs. 
    Michael J. C. Gordon（英语：Michael J. C. Gordon）. From LCF to HOL: a short history. 1996 [2021-02-27]. （原始内容存档于2016-09-05）. Around 1973 Milner moved to Edinburgh University and established a project to build a successor to Stanford LCF, which was subsequently dubbed Edinburgh LCF. He initially hired Lockwood Morris and Malcolm Newey (both recent PhD graduates from Stanford) as research assistants. …… Milner, ably assisted by Morris and Newey, designed the programming language ML (an abbreviation for “Meta Language”). …… In 1975, Morris and Newey took up faculty positions at Syracuse University and the Australian National University, respectively, and were replaced by Chris Wadsworth and myself. The design and implementation of ML and Edinburgh LCF was finalised and the book “Edinburgh LCF” was written and published. In 1978, the first LCF project finished, Chris Wadsworth went off trekking in the Andes (returning to a permanent position at the Rutherford Appleton Laboratory) and I remained at Edinburgh supported by a postdoctoral fellowship and with a new research interest: hardware verification. 
  • The original Edinburgh LCF. 1977 [2021-10-10]. （原始内容存档于2021-10-10）. 
  • Lawrence C. Paulson. The theorem prover Cambridge LCF. coded in Franz Lisp. 1989 [2021-10-10]. （原始内容存档于2021-10-10）. 
    Michael J. C. Gordon（英语：Michael J. C. Gordon）. From LCF to HOL: a short history. 1996 [2021-02-27]. （原始内容存档于2016-09-05）. In 1981, I moved to a permanent position as Lecturer at the University of Cambridge Computer Laboratory. ……Larry Paulson, recently graduated with a PhD from Stanford, was hired at Cambridge ……. About this time, and in parallel, G ́erard Huet ported the Edinburgh LCF code to Lelisp and MacLisp. Paulson and Huet then established a collaboration and did a lot of joint development of LCF by sending each other magnetic tapes in the post. …… Edinburgh LCF ran interpretively, but during Paulson and Huet’s collaboration an ML compiler was implemented that provided a speedup by a factor of about twenty. …… The resulting new LCF system was named “Cambridge LCF” and completed around 1985. Paulson did little work on it after that. Mikael Hedlund (of the Rutherford Appleton Laboratory) then ported Cambridge LCF to Standard ML (using a new implementation of ML that he created). The resulting Standard ML based version of Cambridge LCF is documented …… in Paulson’s 1987 book Logic and Computation. 
  • HOL88, source code. 
    Michael J. C. Gordon（英语：Michael J. C. Gordon）. From LCF to HOL: a short history. 1996 [2021-02-27]. （原始内容存档于2016-09-05）. Whilst Paulson was designing and implementing Cambridge LCF, I was mainly concerned with hardware verification. …… The first version of the HOL system was created by modifying the Cambridge LCF parser and pretty-printer to support higher order logic concrete syntax. …… The core HOL system became stable in about 1988. A new release that consolidated various changes and enhancements called HOL88 was issued then. We were fortunate to receive support from DSTO Australia to document HOL and from Hewlett Packard to port it from Franz Lisp to Common Lisp (a job very ably done by John Carroll). …… In the late 1980’s Graham Birtwistle of the University of Calgary started a project to reimplement HOL in Standard ML. The work was done by Konrad Slind, under Birtwistle’s direction and with the collaboration of the HOL group at Cambridge. The resulting system, called HOL90, was first released around 1990. …… Recently John Harrison and Konrad Slind have entirely reworked the design of HOL ……. …… This new version of HOL is called “HOL Light”. It is implemented in Caml Light and runs on modest platforms (e.g. standard PCs). It is faster than the Lisp-based HOL88, but a bit slower than HOL90 running in modern implementations of Standard ML. 

chalmers.se

cse.chalmers.se

chlipala.net

adam.chlipala.net

cmu.edu

cs.cmu.edu

cornell.edu

cs.cornell.edu

ed.ac.uk

homepages.inf.ed.ac.uk

dcs.ed.ac.uk

pure.ed.ac.uk

  • Robin Milner. How ML Evolved (PDF). Polymorphism—The ML/LCF/Hope Newsletter,Vol. 1, No. 1. 1982 [2021-09-09]. （原始内容 (PDF)存档于2022-01-28）. 

epdf.pub

  • Michael J. Gordon, Arthur J. Milner, Christopher P. Wadsworth. Edinburgh LCF: A Mechanised Logic of Computation. Lecture Notes in Computer Science, Vol. 78. Springer-Verlag, New York, NY, USA. 1979 [2021-12-28]. （原始内容存档于2021-12-28）. ML is a general purpose programming language. It is derived in different aspects from ISWIM, POP2 and GEDANKEN, and contains perhaps two new features. First, it has an escape and escape trapping mechanism, well-adapted to programming strategies which may be (in fact usually are) inapplicable to certain goals. Second, it has a polymorphic type discipline which combines the flexibility of programming in a typeless language with the security of compile-time type checking (as in other languages, you may also define your own types, which may be abstract and/or recursive); this is what ensures that a well-typed program cannot perform faulty proofs. 
    Michael J. C. Gordon（英语：Michael J. C. Gordon）. From LCF to HOL: a short history. 1996 [2021-02-27]. （原始内容存档于2016-09-05）. Around 1973 Milner moved to Edinburgh University and established a project to build a successor to Stanford LCF, which was subsequently dubbed Edinburgh LCF. He initially hired Lockwood Morris and Malcolm Newey (both recent PhD graduates from Stanford) as research assistants. …… Milner, ably assisted by Morris and Newey, designed the programming language ML (an abbreviation for “Meta Language”). …… In 1975, Morris and Newey took up faculty positions at Syracuse University and the Australian National University, respectively, and were replaced by Chris Wadsworth and myself. The design and implementation of ML and Edinburgh LCF was finalised and the book “Edinburgh LCF” was written and published. In 1978, the first LCF project finished, Chris Wadsworth went off trekking in the Andes (returning to a permanent position at the Rutherford Appleton Laboratory) and I remained at Edinburgh supported by a postdoctoral fellowship and with a new research interest: hardware verification. 

futhark-lang.org

github.com

inria.fr

caml.inria.fr

  • A History of Caml. [2021-08-31]. （原始内容存档于2022-04-13）. The Formel team became interested in the ML language in 1980-81. ……Gérard Huet decided to make the ML implementation compatible with various Lisp compilers (MacLisp, FranzLisp, LeLisp, ZetaLisp). This work involved Guy Cousineau and Larry Paulson. ……Guy Cousineau also added algebraic data types and pattern-matching, following ideas from Robin Milner ……. At some point, this implementation was called Le_ML, a name that did not survive. It was used by Larry Paulson to develop Cambridge LCF and by Mike Gordon for the first version of HOL ……. ……
    Our main reason for developing Caml was to use it for sofware development inside Formel. Indeed, it was used for developing the Coq system ……. We were reluctant to adopt a standard that could later prevent us from adapting the language to our programming needs. ……We did incorporate into Caml most of the improvements brought by Standard ML over Edinburgh ML. ……The first implementation of Caml appeared in 1987 and was further developed until 1992. It was created mainly by Ascander Suarez. ……
    In 1990 and 1991, Xavier Leroy designed a completely new implementation of Caml, based on a bytecode interpreter written in C. Damien Doligez provided an excellent memory management system. ……In 1995, Xavier Leroy released Caml Special Light, which improved over Caml Light in several ways. In 1995, Xavier Leroy released Caml Special Light, which improved over Caml Light in several ways. First, an optimizing native-code compiler was added to the bytecode compiler. ……Second, Caml Special Light offered a high-level module system, designed by Xavier Leroy and inspired by the module system of Standard ML. ……Didier Rémy, later joined by Jérôme Vouillon, designed an elegant and highly expressive type system for objects and classes. This design was integrated and implemented within Caml Special Light, leading to the Objective Caml language and implementation, first released in 1996 and renamed to OCaml in 2011.     
  • Xavier Leroy（英语：Xavier Leroy）. The Caml Light system Release 0.74, documentation and user's guide. 1997 [2021-09-02]. （原始内容存档于2022-03-08）. 
  • Xavier Leroy. Manifest types, modules, and separate compilation (PDF). Principles of Programming Languages. 1994 [2021-09-07]. （原始内容 (PDF)存档于2021-10-22）. 
  • Didier Rémy. Type inference for records in a natural extension of ML. Research Report RR-1431, INRIA. 1991 [2021-09-10]. （原始内容存档于2022-04-06）. 
    Didier Rémy, Jérôme Vouillon. Objective ML: a simple object-oriented extension of ML (PDF). 1997 [2021-09-06]. （原始内容 (PDF)存档于2022-01-21）. 
    Didier Rémy, Jérôme Vouillon. Objective ML: An effective object-oriented extension to ML (PDF). 1998 [2021-09-06]. （原始内容 (PDF)存档于2022-01-20）. 
  • Xavier Leroy. The Objective Caml system release 1.07, Documentation and user's manual. 1997 [2021-09-02]. （原始内容存档于2022-01-23）. 

hal.inria.fr

gallium.inria.fr

it-sudparis.eu

www-public.it-sudparis.eu

  • M. Gordon, R. Milner, L. Morris, M. Newey, C. Wadsworth. A Metalanguage for Interactive Proof in LCF (PDF). 1978 [2021-08-31]. （原始内容 (PDF)存档于2021-05-06）. ML is a higher-order functional programming language in the tradition of ISWIM, PAL, POP2 and GEDANKEN, but differs principally in its handling of failure and, more so, of types. 

jstor.org

kent.ac.uk

cs.kent.ac.uk

launchpad.net

  • HOL88, source code. 
    Michael J. C. Gordon（英语：Michael J. C. Gordon）. From LCF to HOL: a short history. 1996 [2021-02-27]. （原始内容存档于2016-09-05）. Whilst Paulson was designing and implementing Cambridge LCF, I was mainly concerned with hardware verification. …… The first version of the HOL system was created by modifying the Cambridge LCF parser and pretty-printer to support higher order logic concrete syntax. …… The core HOL system became stable in about 1988. A new release that consolidated various changes and enhancements called HOL88 was issued then. We were fortunate to receive support from DSTO Australia to document HOL and from Hewlett Packard to port it from Franz Lisp to Common Lisp (a job very ably done by John Carroll). …… In the late 1980’s Graham Birtwistle of the University of Calgary started a project to reimplement HOL in Standard ML. The work was done by Konrad Slind, under Birtwistle’s direction and with the collaboration of the HOL group at Cambridge. The resulting system, called HOL90, was first released around 1990. …… Recently John Harrison and Konrad Slind have entirely reworked the design of HOL ……. …… This new version of HOL is called “HOL Light”. It is implemented in Caml Light and runs on modest platforms (e.g. standard PCs). It is faster than the Lisp-based HOL88, but a bit slower than HOL90 running in modern implementations of Standard ML. 

lucacardelli.name

mauny.net

michel.mauny.net

mlton.org

mpi-sws.org

nemerle.org

nuprl.org

  • G. Cousineau, M. Gordon, G. Huet, R. Milner, L. C. Paulson, C. Wadsworth. The ML Handbook, Version 6.2. Internal document. Project Formel, INRIA. July 1985. 
    Christoph Kreitz, Vincent Rahli. Introduction to Classic ML (PDF). 2011 [2021-09-09]. （原始内容 (PDF)存档于2022-01-29）. This handbook is a revised edition of Section 2 of ‘Edinburgh LCF’, by M. Gordon, R. Milner, and C. Wadsworth, published in 1979 as Springer Verlag Lecture Notes in Computer Science no 78. ……The language is somewhere in between the original ML from LCF and standard ML, since Guy Cousineau added the constructors and call by patterns. This is a LISP based implementation, compatible for Maclisp on Multics, Franzlisp on VAX under Unix, Zetalisp on Symbolics 3600, and Le Lisp on 68000, VAX, Multics, Perkin-Elmer, etc... Video interfaces have been implemented by Philippe Le Chenadec on Multics, and by Maurice Migeon on Symbolics 3600. The ML system is maintained and distributed jointly by INRIA and the University of Cambridge. 

ocaml.org

oup.com

academic.oup.com

polsl.pl

sun.aei.polsl.pl

psu.edu

citeseerx.ist.psu.edu

r-5.org

  • Bruce A. Tate, Fred Daoud, Ian Dees, Jack Moffitt. 3. Elm. Seven More Languages in Seven Weeks (PDF) Book version: P1.0-November 2014. The Pragmatic Programmers, LLC. 2014: 97, 101 [2021-09-04]. ISBN 978-1-941222-15-7. （原始内容 (PDF)存档于2021-03-15）. On page 101, Elm creator Evan Czaplicki says: 'I tend to say "Elm is an ML-family language" to get at the shared heritage of all these languages.' ["these languages" is referring to Haskell, OCaml, SML, and F#.] 

researchgate.net

sciencedirect.com

smlfamily.github.io

smlnj.org

uchile.cl

cec.uchile.cl

uni-saarland.de

ps.uni-saarland.de

utexas.edu

cs.utexas.edu

web.archive.org

wikipedia.org

en.wikipedia.org

  • Michael J. Gordon, Arthur J. Milner, Christopher P. Wadsworth. Edinburgh LCF: A Mechanised Logic of Computation. Lecture Notes in Computer Science, Vol. 78. Springer-Verlag, New York, NY, USA. 1979 [2021-12-28]. （原始内容存档于2021-12-28）. ML is a general purpose programming language. It is derived in different aspects from ISWIM, POP2 and GEDANKEN, and contains perhaps two new features. First, it has an escape and escape trapping mechanism, well-adapted to programming strategies which may be (in fact usually are) inapplicable to certain goals. Second, it has a polymorphic type discipline which combines the flexibility of programming in a typeless language with the security of compile-time type checking (as in other languages, you may also define your own types, which may be abstract and/or recursive); this is what ensures that a well-typed program cannot perform faulty proofs. 
    Michael J. C. Gordon（英语：Michael J. C. Gordon）. From LCF to HOL: a short history. 1996 [2021-02-27]. （原始内容存档于2016-09-05）. Around 1973 Milner moved to Edinburgh University and established a project to build a successor to Stanford LCF, which was subsequently dubbed Edinburgh LCF. He initially hired Lockwood Morris and Malcolm Newey (both recent PhD graduates from Stanford) as research assistants. …… Milner, ably assisted by Morris and Newey, designed the programming language ML (an abbreviation for “Meta Language”). …… In 1975, Morris and Newey took up faculty positions at Syracuse University and the Australian National University, respectively, and were replaced by Chris Wadsworth and myself. The design and implementation of ML and Edinburgh LCF was finalised and the book “Edinburgh LCF” was written and published. In 1978, the first LCF project finished, Chris Wadsworth went off trekking in the Andes (returning to a permanent position at the Rutherford Appleton Laboratory) and I remained at Edinburgh supported by a postdoctoral fellowship and with a new research interest: hardware verification. 
  • Lennart Augustsson（英语：Lennart Augustsson）, Thomas Johnsson. The Chalmers Lazy-ML Compiler. 1989 [2021-09-17]. （原始内容存档于2021-09-17）. 
  • Luca Cardelli（英语：Luca Cardelli）. ML under VMS (PDF). 1982 [2021-09-04]. （原始内容 (PDF)存档于2021-11-06）. 
  • Luca Cardelli（英语：Luca Cardelli）. The Functional Abstract Machine. 1983 [2021-09-04]. （原始内容存档于2021-09-04）.  Bell Labs Technical Report TR-107.
    Luca Cardelli. Compiling a functional language. 1984 [2021-09-03]. （原始内容存档于2021-09-03）.  In Proceedings of the 1984 ACM Symposium on LISP and Functional Programming, pages 208–217, New York, NY, USA. ACM.
  • Guy Cousineau, Gérard Huet（英语：Gérard Huet）. The CAML primer Version 2.6.1. 1990 [2021-09-02]. （原始内容存档于2022-05-04）.  RT-0122, INRIA. pp.78.
    Pierre Weis, Maria Virginia Aponte, Alain Laville, Michel Mauny, Ascander Suarez. The CAML reference manual Version 2.6.1. 1990 [2021-09-02]. （原始内容存档于2022-04-06）.  [Research Report] RT-0121, INRIA. pp.491.
  • Lawrence C. Paulson. The theorem prover Cambridge LCF. coded in Franz Lisp. 1989 [2021-10-10]. （原始内容存档于2021-10-10）. 
    Michael J. C. Gordon（英语：Michael J. C. Gordon）. From LCF to HOL: a short history. 1996 [2021-02-27]. （原始内容存档于2016-09-05）. In 1981, I moved to a permanent position as Lecturer at the University of Cambridge Computer Laboratory. ……Larry Paulson, recently graduated with a PhD from Stanford, was hired at Cambridge ……. About this time, and in parallel, G ́erard Huet ported the Edinburgh LCF code to Lelisp and MacLisp. Paulson and Huet then established a collaboration and did a lot of joint development of LCF by sending each other magnetic tapes in the post. …… Edinburgh LCF ran interpretively, but during Paulson and Huet’s collaboration an ML compiler was implemented that provided a speedup by a factor of about twenty. …… The resulting new LCF system was named “Cambridge LCF” and completed around 1985. Paulson did little work on it after that. Mikael Hedlund (of the Rutherford Appleton Laboratory) then ported Cambridge LCF to Standard ML (using a new implementation of ML that he created). The resulting Standard ML based version of Cambridge LCF is documented …… in Paulson’s 1987 book Logic and Computation. 
  • HOL88, source code. 
    Michael J. C. Gordon（英语：Michael J. C. Gordon）. From LCF to HOL: a short history. 1996 [2021-02-27]. （原始内容存档于2016-09-05）. Whilst Paulson was designing and implementing Cambridge LCF, I was mainly concerned with hardware verification. …… The first version of the HOL system was created by modifying the Cambridge LCF parser and pretty-printer to support higher order logic concrete syntax. …… The core HOL system became stable in about 1988. A new release that consolidated various changes and enhancements called HOL88 was issued then. We were fortunate to receive support from DSTO Australia to document HOL and from Hewlett Packard to port it from Franz Lisp to Common Lisp (a job very ably done by John Carroll). …… In the late 1980’s Graham Birtwistle of the University of Calgary started a project to reimplement HOL in Standard ML. The work was done by Konrad Slind, under Birtwistle’s direction and with the collaboration of the HOL group at Cambridge. The resulting system, called HOL90, was first released around 1990. …… Recently John Harrison and Konrad Slind have entirely reworked the design of HOL ……. …… This new version of HOL is called “HOL Light”. It is implemented in Caml Light and runs on modest platforms (e.g. standard PCs). It is faster than the Lisp-based HOL88, but a bit slower than HOL90 running in modern implementations of Standard ML. 
  • Rod Burstall（英语：Rod Burstall）, D.B. MacQueen, D.T. Sannella（英语：Don Sannella）. Hope: An Experimental Applicative Language (PDF). 1980 [2021-09-03]. （原始内容 (PDF)存档于2022-01-28）.  Conference Record of the 1980 LISP Conference, Stanford University, pp. 136-143.
  • Andrew W. Appel（英语：Andrew Appel）, David MacQueen. A Standard ML compiler. 1987 [2021-09-03]. （原始内容存档于2021-09-03）. 
    David Macueen. An Implementation of Standard ML Modules. 1988 [2021-09-03]. （原始内容存档于2021-09-03）. 
  • Andrew W. Appel（英语：Andrew Appel）, David MacQueen. Standard ML of New Jersey. 1991 [2021-08-31]. （原始内容存档于2021-08-31）. 
    Standard ML of New Jersey, Version 0.93. 1993 [2021-09-14]. （原始内容存档于2022-03-28）. 
  • Xavier Leroy（英语：Xavier Leroy）. The Caml Light system Release 0.74, documentation and user's guide. 1997 [2021-09-02]. （原始内容存档于2022-03-08）. 
  • Samuel Horsley（英语：Samuel Horsley） F. R. S. Κόσκινον Ερατοσθένους or, The Sieve of Eratosthenes. Being an account of his method of finding all the Prime Numbers. Philosophical Transactions (1683–1775), Vol. 62. (1772), pp. 327–347. 1772 [2021-09-13]. （原始内容存档于2018-10-02）. 

wikisource.org

zh.wikisource.org

  • Gerald J. Sussman, Guy L. Steele Jr. 链接至维基文库 Scheme: An Interpreter for Extended Lambda Calculus. 维基文库. 1975 （英文）. It is always possible, ……to perform any calculation in this way: rather than reducing to its value, it reduces to an application of a continuation to its value (cf. [Fischer]). That is, in this continuation-passing programming style, a function always "returns" its result by "sending" it to another function.