1,365 research outputs found
New eta-reduction and Church-Rosser
No full textAbstract This paper introduces a new eta-reduction rule for l-calculus with dependent types and prove the property of Church-Rosser
Church-Rosser Made Easy
No full textThe Church-Rosser theorem states that the lambda-calculus is confluent under alpha- and beta-reductions. The standard proof of this result is due to Tait and Martin-Loef. In this note, we present an alternative proof based on the notion of acceptable orderings. The technique is easily modified to give confluence of the beta-eta-calculus.National Science Foundation CCF-063502
Timor-Leste human development report 2011 : managing natural resources for human development : developing the non-oil economy to achieve the MDGs
No full textPrincipal Author John G Taylor, Coordinator Rui Gomes, Authors, Technical Background Papers Tobias N. Rasmussen, Andrew Rosser, Martin Sandbu, Michael Ross, Tibor van Staveren, Ricardo F. Neupert, Rui A. Gomes, John G Taylor, Sonny Harmadi, Hafiz Pash
Exploring evidence-based practice: Debates and challenges in nursing
No full textEdited work - contributors include (alphabetical order): Peter Allmark, Davina Banner-Lukaris, Robyn Bluhm, Bernie Garrett, Martin Lipscomb, Margaret Miers, John Paley, Gary Rolfe, Elizabeth Rosser, Derek Sellman, Paul Snelling, Sally Thorne
Customary Law: The Way Things Were, Codified
No full textThe author explores the meaning of customary law from its most general meaning to the meaning and application within various tribal courts. Mr. Rosser discusses the weight of customary law when choice of law and conflict of law issues arise within tribal courts. He discusses the challenges in uniformly applying customary law. He also discusses the challenges in substantiating customs when presented to a tribal court, including the use of experts. Mr. Rosser highlights the complexity and variance of customary law between tribal courts while emphasizing the importance of tribal jurisprudence. Finally, the author provides an appendix of rules and rights derived from the customary laws of various tribes
Isothermal Recombinase Polymerase amplification (RPA) of Schistosoma haematobium DNA and oligochromatographic lateral flow detection
No full text© 2015 Rosser et al. Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated. The attached file is the published version of the article.NHM Repositor
Polishing Up the Tait-Martin-Löf Proof of the Church-Rosser Theorem
No full textIntroduction The Tait--Martin-Lof proof is the best known and simplest proof of confluence (the Church--Rosser theorem) for various lambda calculi. It is explained in detail, for example, in [Bar84, HS86, Rev88]. The desire to clarify this proof has inspired work on concrete representation of binding [dB72, Coq91]. Perhaps the best modern version is given in [Tak95]. Formal proofs are reported in [Hue94, MP93, Pfe92, Sha88] 1 . In this note I outline the innovation given in [Tak95] (and formalized by McKinna [MP93]), and present a further improvement which I believe has not appeared in the literature before. 1.1 Preliminary Definitions Let Rel2 be the class of binary relations, and R; T 2 Rel2 ; we write aRb for (a; b) 2 R . For R 2 Rel2 the transitive reflexive closure of R , wr
A proof of the Church-Rosser theorem and its representation in a logical framework
No full textWe give a detailed, informal proof of the Church-Rosser property for the untyped λ-calculus and show its representation in LF. The proof is due to Tait and Martin-Löf and is based on the notion of parallel reduction. The representation employs higher-order abstract syntax and the judgments-as-types principle and takes advantage of term reconstruction as it is provided in the Elf implementation of LF. Proofs of meta-theorems are represented as higher-level judgments which relate sequences of reductions and conversions
sj-pdf-1-ctj-10.1177_17407745231209224 – Supplemental material for Perspectives of adults with neurofibromatosis regarding the design of psychosocial trials: Results from an anonymous online survey
No full textSupplemental material, sj-pdf-1-ctj-10.1177_17407745231209224 for Perspectives of adults with neurofibromatosis regarding the design of psychosocial trials: Results from an anonymous online survey by Pamela L Wolters, Nour Al Ghriwati, Melissa Baker, Staci Martin, Dale Berg, Gregg Erickson, Barbara Franklin, Vanessa L Merker, Beverly Oberlander, Stephanie Reeve, Claas Rohl, Tena Rosser and Ana-Maria Vranceanu in Clinical Trials</p
Cálculo lambda de primer orden con constraints y la propiedad church-rosser
No full textEn [2,3] fue presentada una extensión al tradicional cálculo lambda con constraints.
Los constraints pueden ser usados con dos distintos propósitos: en una forma pasiva, restringiendo el rango de variables, o en forma activa comput.andp soluciones a determinados sistemas. Aquí presentamos una extensión de aquél cálculo, agregándole cuantificadores existenciales de modo de enfatizar las teorías de Henkin y para eliminar el problema de las variables compartidas. También definimos nuevas' reglas para la manipulación de los nuevos términos del lenguaje. La semántica denotacional del cálculo es presentada, así como también la demostración de la propiedad Church-Rosser (CR). Además probamos que las reglas de reducción son correctas y que la función semántica está bien definida.Eje: 2do. Workshop sobre aspectos teóricos de la inteligencia artificialRed de Universidades con Carreras en Informática (RedUNCI
- …
