BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
rosser (22)
languag (10)
properti (9)
problem (8)
system (8)

Stem church$ (all stems)

40 papers:

IFLIFL-2014-KoopmanPJ #data type #encoding #functional #harmful #implementation
Church Encoding of Data Types Considered Harmful for Implementations: Functional Pearl (PWMK, RP, JMJ), p. 4.
RTARTA-2013-FujitaS #decidability
Decidable structures between Church-style and Curry-style (KeF, AS), pp. 190–205.
WRLAWRLA-J-2010-DuranM12 #on the #order
On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories (FD, JM), pp. 816–850.
DLTDLT-J-2011-ArrighiD12 #physics #quantum
The Physical Church-Turing Thesis and the Principles of Quantum Theory (PA, GD), pp. 1131–1146.
ICALPICALP-v2-2012-DiekertKRW #regular expression
Regular Languages Are Church-Rosser Congruential (VD, MK, KR, TW), pp. 177–188.
LATALATA-2012-Dowek #automaton #formal method #physics #quantum
Around the Physical Church-Turing Thesis: Cellular Automata, Formal Languages, and the Principles of Quantum Theory (GD), pp. 21–37.
CSLCSL-2012-JouannaudL
Church-Rosser Properties of Normal Rewriting (JPJ, JL), pp. 350–365.
LICSLICS-2012-Constable #on the
On Building Constructive Formal Theories of Computation Noting the Roles of Turing, Church, and Brouwer (RLC), pp. 2–8.
FoSSaCSFoSSaCS-2011-VelnerR #problem #synthesis
Church Synthesis Problem for Noisy Input (YV, AR), pp. 275–289.
CSLCSL-2011-JenkinsORW #metric #problem #synthesis
The Church Synthesis Problem with Metric (MJ, JO, AR, JW), pp. 307–321.
WRLAWRLA-2010-DuranM #equation #maude #order #specification
A Church-Rosser Checker Tool for Conditional Order-Sorted Equational Maude Specifications (FD, JM), pp. 69–85.
FLOPSFLOPS-2010-KetemaS #bound #diagrams #term rewriting #λ-calculus
Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus (JK, JGS), pp. 272–287.
FLOPSFLOPS-2010-RemyY
A Church-Style Intermediate Language for MLF (DR, BY), pp. 24–39.
FoSSaCSFoSSaCS-2009-Thomas #problem #synthesis
Facets of Synthesis: Revisiting Church’s Problem (WT), pp. 1–14.
CSLCSL-2009-Rabinovich #decidability #problem
Decidable Extensions of Church’s Problem (AR), pp. 424–439.
CSLCSL-2007-RabinovichT #logic #problem
Logical Refinements of Church’s Problem (AR, WT), pp. 69–83.
CSLCSL-2006-Rabinovich #parametricity #problem #synthesis
Church Synthesis Problem with Parameters (AMR), pp. 546–561.
RTARTA-2006-Jouannaud #composition
Modular Church-Rosser Modulo (JPJ), pp. 96–107.
ICALPICALP-2002-JurdzinskiL
Church-Rosser Languages vs. UCFL (TJ, KL), pp. 147–158.
ICDARICDAR-2001-FeldbachT #detection #segmentation
Line Detection and Segmentation in Historical Church Registers (MF, KDT), pp. 743–747.
DLTDLT-2001-NiemannW01a #regular expression
Some Regular Languages That Are Church-Rosser Congruential (GN, JW), pp. 330–339.
RTARTA-2001-Woinowski #normalisation
A Normal Form for Church-Rosser Language Systems (JRW), pp. 322–337.
LICSLICS-2000-Kripke #algorithm #first-order #theorem
From the Church-Turing Thesis to the First-Order Algorithm Theorem (SK), p. 177.
DLTDLT-1999-NiemannO #automaton
Restarting automata, Church-Rosser languages, and representations of r.e. languages (GN, FO), pp. 103–114.
ITiCSEITiCSE-1998-Taylor
Motivating the Church-Turing thesis in the twenty-first century (RGT), pp. 228–231.
FoSSaCSFoSSaCS-1998-NiemannO #context-sensitive grammar
The Church-Rosser Languages Are the Deterministic Variants of the Growing Context-Sensitive Languages (GN, FO), pp. 243–257.
POPLPOPL-1998-Schubert #higher-order #morphism #polymorphism #type inference #unification
Second-Order Unification and Type Inference for Church-Style Polymorphism (AS), pp. 279–288.
RTARTA-1998-Ohlebusch #equivalence #reduction #theorem
Church-Rosser Theorems for Abstract Reduction Modulo an Equivalence Relation (EO), pp. 17–31.
RTARTA-1998-Okui
Simultaneous Critical Pairs and Church-Rosser Property (SO), pp. 2–16.
RTARTA-1997-OyamaguchiO #linear #parallel #term rewriting
A New Parallel Closed Condition for Church-Rossser of Left-Linear Term Rewriting Systems (MO, YO), pp. 187–201.
CADECADE-1996-Nipkow #higher-order #proving
More Church-Rosser Proofs (in Isabelle/HOL) (TN), pp. 733–747.
LICSLICS-1994-GeuversW #on the #type system
On the Church-Rosser Property for Expressive Type Systems and its Consequences for their Metatheoretic Study (HG, BW), pp. 320–329.
LICSLICS-1992-Geuvers #λ-calculus
The Church-Rosser Property for βη-reduction in Typed λ-Calculi (HG), pp. 453–460.
CSLCSL-1991-ThistleW #automaton #problem
Control of ω-Automata, Church’s Problem, and the Emptiness Problem for Tree ω-Automata (JGT, WMW), pp. 367–382.
ICALPICALP-1990-Klop #term rewriting
Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond (JWK), pp. 350–369.
RTARTA-1985-Otto #algebra #finite #monad
Deciding Algebraic Properties of Monoids Presented by Finite Church-Rosser Thue Systems (FO), pp. 95–106.
ICGTGG-1982-EhrigS #graph transformation
Church-Rosser properties for graph replacement systems with unique splitting (HE, JS), pp. 82–101.
CADECADE-1982-Book #power of #string #term rewriting
The Power of the Church-Rosser Property for String Rewriting Systems (RVB), pp. 360–368.
ICALPICALP-1974-Dezani-CiancagliniZ #algorithm #parallel #performance
Application of Church-Rosser Properties to Increase the Parallelism and Efficiency of Algorithms (MDC, MZ), pp. 170–184.
STOCSTOC-1970-Rosen #theorem
Tree-Manipulating Systems and Church-Rosser Theorems (BKR), pp. 117–127.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.