{"title":"ML中的函数式编程","authors":"Lawrence Charles Paulson","doi":"10.1081/E-ESE-120044136","DOIUrl":null,"url":null,"abstract":"ML is a functional language like Scheme Very different from Scheme in syntax and use Can be pure – no assignment ML stands for Meta Language Originally developed for theorem proving (1978, revised 1997) Very popular in Europe ML characteristics Static type checking – types are very important Strong type checking – program is \"safe\" if interpreter accepts \"variables\" must be declared Syntax more like C than Scheme Fall 2012 CIS 425-ML 2","PeriodicalId":386020,"journal":{"name":"Encyclopedia of Software Engineering","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Functional Programming in ML\",\"authors\":\"Lawrence Charles Paulson\",\"doi\":\"10.1081/E-ESE-120044136\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ML is a functional language like Scheme Very different from Scheme in syntax and use Can be pure – no assignment ML stands for Meta Language Originally developed for theorem proving (1978, revised 1997) Very popular in Europe ML characteristics Static type checking – types are very important Strong type checking – program is \\\"safe\\\" if interpreter accepts \\\"variables\\\" must be declared Syntax more like C than Scheme Fall 2012 CIS 425-ML 2\",\"PeriodicalId\":386020,\"journal\":{\"name\":\"Encyclopedia of Software Engineering\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Encyclopedia of Software Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1081/E-ESE-120044136\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Encyclopedia of Software Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1081/E-ESE-120044136","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
摘要
ML是一种像Scheme一样的函数式语言，在语法和用法上与Scheme非常不同，可以是纯的-没有赋值ML代表元语言最初是为定理证明而开发的(1978年，1997年修订)在欧洲非常流行ML特征静态类型检查-类型非常重要强类型检查-如果解释器接受“变量”必须声明，程序是“安全的”语法更像C而不是Scheme Fall 2012 CIS 425-ML 2
ML is a functional language like Scheme Very different from Scheme in syntax and use Can be pure – no assignment ML stands for Meta Language Originally developed for theorem proving (1978, revised 1997) Very popular in Europe ML characteristics Static type checking – types are very important Strong type checking – program is "safe" if interpreter accepts "variables" must be declared Syntax more like C than Scheme Fall 2012 CIS 425-ML 2
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
