Filters








46 Hits in 3.1 sec

A church-style intermediate language for MLF

Didier Rémy, Boris Yakobowski
2012 Theoretical Computer Science  
We present x ML F , a Church-style version of ML F with full type information that can easily be maintained during reduction.  ...  We exhibit a type preserving encoding of ML F into x ML F , which shows that x ML F can be used as the internal language for ML F after type inference, and also ensures type soundness for the most expressive  ...  In this article, we present x ML F , a Church-style version of ML F that contains full type information.  ... 
doi:10.1016/j.tcs.2012.02.026 fatcat:kehmy5bww5eermlseewmsrljnq

Preface

Matthias Blume, Germán Vidal
2012 Theoretical Computer Science  
For the new calculus, dubbed the Λµ-calculus, the author establishes a standardization theorem, deduces a characterization of solvability, describes Λµ-Böhm trees, and connects it with stream computing  ...  In particular, we wish to thank the authors for preparing and submitting extended versions of their conference papers and all the referees for their invaluable contributions.  ...  In ''A Church-Style Intermediate Language for MLF,'' Didier Rémy and Boris Yakobowski -both among the original inventors of MLF -present xMLF, a Church-style version of MLF where type information can be  ... 
doi:10.1016/j.tcs.2012.02.021 fatcat:rv5fbdzvondj7eeut5gd7ubnoq

On the power of coercion abstraction

Julien Cretin, Didier Rémy
2012 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '12  
The latter variant subsumes F η , F <: , and MLF in a unied framework.  ...  We obtain a language where coercions do not contribute to the reduction but may block it and are thus not erasable.  ...  A Delayed Proofs Proof of Lem 3 The proof is standard. It uses Lemma 2 to ensure well-formedness of Γ from the hypothesis. The second and third cases are proved by mutual induction.  ... 
doi:10.1145/2103656.2103699 dblp:conf/popl/CretinR12 fatcat:gtd47sxwefgsrkmnpr6a4llt4q

On the power of coercion abstraction

Julien Cretin, Didier Rémy
2012 SIGPLAN notices  
The latter variant subsumes F η , F <: , and MLF in a unied framework.  ...  We obtain a language where coercions do not contribute to the reduction but may block it and are thus not erasable.  ...  A Delayed Proofs Proof of Lem 3 The proof is standard. It uses Lemma 2 to ensure well-formedness of Γ from the hypothesis. The second and third cases are proved by mutual induction.  ... 
doi:10.1145/2103621.2103699 fatcat:owx2ajkyybab3izvpnkvqkgfqy

Mixed Languages as Outcomes of Code-Switching: Recent Examples from Australia and Their Implications

Patrick McConvell
2008 Journal of Language Contact  
' (21) PPs in MT TT MT (a) ngu-mpu-nginji-kuruwala (b) yi-kirimi jurra fu ngawa I -NPST-you DAT-sing hePST-make church for us 'I will sing for you.' 'He made a church for us.'  ...  as ML, with, in some situations, intermediate composite ML stages.  ... 
doi:10.1163/000000008792525327 fatcat:e72dykcodzdcvpox3epqiensmy

A Church-Style Intermediate Language for ML F [chapter]

Didier Rémy, Boris Yakobowski
2010 Lecture Notes in Computer Science  
We present x ML F , a Church-style version of ML F with full type information that can easily be maintained during reduction.  ...  We exhibit a type preserving encoding of ML F into x ML F , which shows that x ML F can be used as the internal language for ML F after type inference, and also ensures type soundness for the most expressive  ...  In this article, we present x ML F , a Church-style version of ML F that contains full type information.  ... 
doi:10.1007/978-3-642-12251-4_4 fatcat:ln2pzae3uzgbnpxvnjv4gqjuwa

Code-switching processes [chapter]

Pieter Muysken
1997 IMPACT: Studies in Language and Society  
The term congruent lexi calization refers to a situation where the two languages share a grammatical structure which can be filled lexically with elements from either language.  ...  below), and that the elements from the two languages are inserted, as constituents or as words, into a shared structure.  ...  Acknowledgements This paper was given in various stages of development at the Summer School on Code-Switching and Language Contact at the Fryske Akademy in Leeuwarden/Ljouwert (September 1994, in a poster  ... 
doi:10.1075/impact.1.25muy fatcat:4joz4ieesbdyxior3qfjx2rhjy

Recasting MLF

Didier Le Botlan, Didier Rémy
2009 Information and Computation  
The language ML F is a proposal for a new type system that supersedes both ML and System F, allows for efficient, predictable, and complete type inference for partially annotated terms.  ...  We derive the Church-style version eML F by refining types of iML F so as to distinguish between given and inferred polymorphism.  ...  We thank the anonymous referees for their precious comments.  ... 
doi:10.1016/j.ic.2008.12.006 fatcat:ojbaprppgzarpbozexjauazbfm

Annotated Bibliography of Modern Language Methodology for 1950

Evelyn Eenenaam
1952 The Modern Language Journal  
Isn’t there a place in the practical teaching of lan- guages for this aspect of language study? Waterman, J. T.: ‘General Linguistics,” MLF, XXXV (Sept.—Dec. ’50), 139-146.  ...  The style, read- ability and human approach provided in the Army Language Pocket Guides can help us in our teaching. 3.  ... 
doi:10.1111/j.1540-4781.1952.tb06106.x fatcat:rimlwp2waje6hhpfsgoquewklu

QML

Claudio V. Russo, Dimitrios Vytiniotis
2009 Proceedings of the 2009 ACM SIGPLAN workshop on ML - ML '09  
Recent years have seen a revival of interest in extending ML's predicative type inference system with impredicative quantification in the style of System F, for which type inference is undecidable.  ...  This paper suggests a modest extension of ML with System F types: the heart of the idea is to extend the language of types with unary universal and existential quantifiers.  ...  Acknowledgements Thanks to the ML'09 anonymous reviewers for their valuable suggestions on related work, Philip Wadler for reminding us of O'Toole and Gifford's work (16) , and Simon Peyton Jones for  ... 
doi:10.1145/1596627.1596630 fatcat:ruxpndc3nvfetlkyspuw4wtxca

The Intermediate Neutrino Program [article]

C. Adams, J.R. Alonso, A.M. Ankowski, J.A. Asaadi, J. Ashenfelter, S.N. Axani, K. Babu, C. Backhouse, H.R. Band, P.S. Barbeau, N. Barros, A. Bernstein, M. Betancourt (+170 others)
2015 arXiv   pre-print
The workshop examined promising opportunities for neutrino physics in the intermediate term, including possible new small to mid-scale experiments, US contributions to large experiments, upgrades to existing  ...  The US neutrino community gathered at the Workshop on the Intermediate Neutrino Program (WINP) at Brookhaven National Laboratory February 4-6, 2015 to explore opportunities in neutrino physics over the  ...  The neutrino theory community thus recommends support for neutrino theory and that the language of any potential FOA for the intermediate neutrino program be broad enough to allow potential theory proposals  ... 
arXiv:1503.06637v2 fatcat:wlpa7slxbvg2lchimw2edutcja

Page 1 of Evangelist and Religious Review Vol. 21, Issue 46 [page]

1850 Evangelist and Religious Review  
The universal education cost of the building is to be $20,000 or more, signed to quali^ the slave for freedom and Mlf- as wholly groundless.  ...  Now, for a church to be ® ‘he tunes for a reforma ion g the edifice forming their present place of worship, profession of preparing that very generation for the vagrants, disturbing the public jieace,  ... 

Higher-Order Substitutions

Dominic Duggan
2001 Information and Computation  
A new calculus of explicit substitutions for higher-order abstract syntax is introduced, allowing a high-level description of variable binding in object languages while also providing substitutions as  ...  The *_-calculus is a concrete *-calculus of explicit substitutions, designed for reasoning about implementations of *-calculi.  ...  We use the |-order *-calculus with products as a metalanguage, rather than the simple *-calculus used by Nipkow.  ... 
doi:10.1006/inco.2000.2887 fatcat:ivrt66hz5zhvbg5qcg6lldfkby

Explaining Russian-German code-mixing: A usage-based approach [article]

Nikolay Hakimov
2021 Zenodo  
This book is the first to systematically explore the factor usage frequency in a corpus of bilingual speech.  ...  The study of grammatical variation in language mixing has been at the core of research into bilingual language practices.  ...  A lot of people have contributed to the success of this work and I am happy to have the opportunity to thank them. First  ... 
doi:10.5281/zenodo.5589445 fatcat:qcpjpcxzzvarxdkle7v2ctbzdu

Harnessing ML F with the Power of System F [chapter]

Giulio Manzonetto, Paolo Tranquilli
2010 Lecture Notes in Computer Science  
We provide a strong normalization result for ML F , a type system generalizing ML with first-class polymorphism as in system F.  ...  The proof is achieved by translating ML F into a calculus of coercions, and showing that this calculus is just a decorated version of system F.  ...  We thank Didier Rémy for stimulating discussions and remarks, and the anonymous referees for careful reading and detailed comments.  ... 
doi:10.1007/978-3-642-15155-2_46 fatcat:d4hyffs3x5clxbpxpbzfc2pp6a
« Previous Showing results 1 — 15 out of 46 results