{"title":"从蒙太古的量化规则到最小递归语义和无循环递归语言","authors":"Roussanka Loukanova","doi":"10.3233/978-1-60750-762-8-200","DOIUrl":null,"url":null,"abstract":"Moschovakis (2003-2006) developed a logical calculus of th e formal languageLλar of acyclic recursion, which is a type-theoretical work with many potential applications. On the implementation side, large -scale grammars for human languages, e.g. versions of HPSG, have been using semant ic representations casted in the feature-value language Minimal Recursion Sem antics (MRS). While lacking strict formalization, MRS represents successfull y ambiguous quantifier scoping. In this paper, we introduce the basic definitions of MRS by reflecting on possibilities for formalization of MRS with a version of the languageLλar.","PeriodicalId":206420,"journal":{"name":"Biology, Computation and Linguistics","volume":"16 7","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"From Montague's Rules of Quantification to Minimal Recursion Semantics and the Language of Acyclic Recursion\",\"authors\":\"Roussanka Loukanova\",\"doi\":\"10.3233/978-1-60750-762-8-200\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Moschovakis (2003-2006) developed a logical calculus of th e formal languageLλar of acyclic recursion, which is a type-theoretical work with many potential applications. On the implementation side, large -scale grammars for human languages, e.g. versions of HPSG, have been using semant ic representations casted in the feature-value language Minimal Recursion Sem antics (MRS). While lacking strict formalization, MRS represents successfull y ambiguous quantifier scoping. In this paper, we introduce the basic definitions of MRS by reflecting on possibilities for formalization of MRS with a version of the languageLλar.\",\"PeriodicalId\":206420,\"journal\":{\"name\":\"Biology, Computation and Linguistics\",\"volume\":\"16 7\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-01-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Biology, Computation and Linguistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3233/978-1-60750-762-8-200\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Biology, Computation and Linguistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/978-1-60750-762-8-200","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
From Montague's Rules of Quantification to Minimal Recursion Semantics and the Language of Acyclic Recursion
Moschovakis (2003-2006) developed a logical calculus of th e formal languageLλar of acyclic recursion, which is a type-theoretical work with many potential applications. On the implementation side, large -scale grammars for human languages, e.g. versions of HPSG, have been using semant ic representations casted in the feature-value language Minimal Recursion Sem antics (MRS). While lacking strict formalization, MRS represents successfull y ambiguous quantifier scoping. In this paper, we introduce the basic definitions of MRS by reflecting on possibilities for formalization of MRS with a version of the languageLλar.