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:
order (55)
second (45)
logic (43)
graph (21)
program (21)

Stem monad$ (all stems)

176 papers:

DLTDLT-2015-Bojanczyk #monad
Recognisable Languages over Monads (MB), pp. 1–13.
ICALPICALP-v2-2015-BojanczykMW #bound #clique #datalog #monad #source code
Containment of Monadic Datalog Programs via Bounded Clique-Width (MB, FM, AW), pp. 427–439.
ICALPICALP-v2-2015-MichalewskiM #higher-order #logic #monad #quantifier
Baire Category Quantifier in Monadic Second Order Logic (HM, MM), pp. 362–374.
BXBX-2015-JohnsonRa #monad
Distributing Commas, and the Monad of Anchored Spans (MJ, RR), pp. 31–42.
PPDPPPDP-2015-RivasJS #monad
From monoids to near-semirings: the essence of MonadPlus and alternative (ER, MJ, TS), pp. 196–207.
CSLCSL-2015-KuskeLM #decidability #infinity #monad #word
Infinite and Bi-infinite Words with Decidable Monadic Theories (DK, JL, AM), pp. 472–486.
LICSLICS-2015-EnqvistSV #algebra #bisimulation #higher-order #logic #monad
Monadic Second-Order Logic and Bisimulation Invariance for Coalgebras (SE, FS, YV), pp. 353–365.
LICSLICS-2015-McIverMR #data flow #markov #modelling #monad
Abstract Hidden Markov Models: A Monadic Account of Quantitative Information Flow (AM, CM, TMR), pp. 597–608.
PEPMPEPM-2014-PachecoHF #bidirectional #combinator #monad #programming
Monadic combinators for “Putback” style bidirectional programming (HP, ZH, SF), pp. 39–50.
ICALPICALP-v2-2014-GoncharovP #algebra #bisimulation #equation #monad #recursion
Coalgebraic Weak Bisimulation from Recursive Equations over Monads (SG, DP), pp. 196–207.
ICGTICGT-2014-PoskittP #graph #higher-order #monad #source code #verification
Verifying Monadic Second-Order Properties of Graph Programs (CMP, DP), pp. 33–48.
CHICHI-2014-DorkCD #monad
Monadic exploration: seeing the whole through its parts (MD, RC, MDR), pp. 1535–1544.
BXBX-2014-CheneyMSGA #monad
Entangled State Monads (JC, JM, PS, JG, FAS), pp. 108–111.
PADLPADL-2014-BrackerG #domain-specific language #generative #javascript #monad #named
Sunroof: A Monadic DSL for Generating JavaScript (JB, AG), pp. 65–80.
POPLPOPL-2014-Katsumata #monad #parametricity #semantics
Parametric effect monads and semantics of effect systems (SyK), pp. 633–646.
CAVCAV-2014-VeanesBNB #composition #monad
Monadic Decomposition (MV, NB, LN, SB), pp. 628–645.
LICSLICS-CSL-2014-Mamouras #hoare #monad #on the #recursion
On the Hoare theory of monadic recursion schemes (KM), p. 10.
PODSPODS-2013-RudolphK #data access #query
Flag & check: data access with monadically defined queries (SR, MK), pp. 151–162.
ESOPESOP-2013-ToninhoCP #higher-order #integration #monad #process
Higher-Order Processes, Functions, and Sessions: A Monadic Integration (BT, LC, FP), pp. 350–369.
FoSSaCSFoSSaCS-2013-BauerHK #higher-order #monad #on the #parametricity
On Monadic Parametricity of Second-Order Functionals (AB, MH, AK), pp. 225–240.
FoSSaCSFoSSaCS-2013-KatsumataS #algebra #monad #simulation
Preorders on Monads and Coalgebraic Simulations (SyK, TS), pp. 145–160.
PLDIPLDI-2013-SergeyDMMDCP #monad
Monadic abstract interpreters (IS, DD, MM, JM, DD, DC, FP), pp. 399–410.
PLDIPLDI-2013-SwamyWSCL #higher-order #monad #source code #verification
Verifying higher-order programs with the dijkstra monad (NS, JW, CS, JC, BL), pp. 387–398.
ICFPICFP-2013-DelawareKSO #composition #monad
Modular monadic meta-theory (BD, SK, TS, BCdSO), pp. 319–330.
ICFPICFP-2013-SculthorpeBGG #problem
The constrained-monad problem (NS, JB, GG, AG), pp. 287–298.
ICFPICFP-2013-SvenningssonS #composition #embedded #monad
Simple and compositional reification of monadic embedded languages (JS, BJS), pp. 299–304.
ICFPICFP-2013-ZilianiDKNV #coq #monad #named #programming
Mtac: a monad for typed tactic programming in Coq (BZ, DD, NRK, AN, VV), pp. 87–100.
GCMGCM-J-2012-Radke #graph #higher-order #monad
HR* Graph Conditions Between Counting Monadic Second-Order and Second-Order Graph Formulas (HR).
PPDPPPDP-2013-AsadaHKHN #branch #calculus #finite #graph #graph transformation #monad
A parameterized graph transformation calculus for finite graphs with monadic branches (KA, SH, HK, ZH, KN), pp. 73–84.
PLOSPLOS-2013-DzikPRTV #in the cloud #monad #named
MBrace: cloud computing with monads (JD, NP, KR, ET, NV), p. 6.
CSLCSL-2013-Maruyama #category theory #monad
Categorical Duality Theory: With Applications to Domains, Convexity, and the Distribution Monad (YM), pp. 500–520.
LICSLICS-2013-AlurDT #higher-order #monad #string #transducer
From Monadic Second-Order Definable String Transformations to Transducers (RA, ADG, AT), pp. 458–467.
LICSLICS-2013-Colcombet #logic #monad #set #word
Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory (TC), p. 123.
LICSLICS-2013-KreutzerR #higher-order #logic #monad
Quantitative Monadic Second-Order Logic (SK, CR), pp. 113–122.
ICALPICALP-v2-2012-BenediktBS #datalog #monad
Monadic Datalog Containment (MB, PB, PS), pp. 79–91.
ICFPICFP-2012-Danielsson #monad #semantics #using
Operational semantics using the partiality monad (NAD), pp. 127–138.
ICFPICFP-2012-FoltzerKSSJN #composition #scheduling
A meta-scheduler for the par-monad: composable scheduling for the heterogeneous cloud (AF, AK, RS, SS, EJ, RN), pp. 235–246.
ICFPICFP-2012-Huffman #monad #verification
Formal verification of monad transformers (BH), pp. 15–16.
OOPSLAOOPSLA-2012-BocqD #monad #named #network #process #streaming #using #virtual machine
Molecule: using monadic and streaming I/O to compose process networks on the JVM (SB, KD), pp. 315–334.
IJCARIJCAR-2012-Brock-NannestadS #abstraction #monad
Truthful Monadic Abstractions (TBN, CS), pp. 97–110.
LICSLICS-2012-AdamekMBL #monad #set
Coproducts of Monads on Set (JA, SM, NB, PBL), pp. 45–54.
LICSLICS-2012-ElberfeldGT #first-order #higher-order #logic #monad
Where First-Order and Monadic Second-Order Logic Coincide (ME, MG, TT), pp. 265–274.
LICSLICS-2012-EngelmannKS #first-order #higher-order #model checking #monad
First-Order and Monadic Second-Order Model-Checking on Ordered Structures (VE, SK, SS), pp. 275–284.
LICSLICS-2012-McIverMM #information management #nondeterminism #probability
A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and Nondeterminism (AM, LM, CM), pp. 461–470.
ICFPICFP-2011-Filinski #monad #towards
Towards a comprehensive theory of monadic effects (AF), p. 1.
ICFPICFP-2011-GibbonsH #equation #monad #reasoning
Just do it: simple monadic equational reasoning (JG, RH), pp. 2–14.
ICFPICFP-2011-SchrijversO #monad #stack
Monads, zippers and views: virtualizing the monad stack (TS, BCdSO), pp. 32–44.
ICFPICFP-2011-SwamyGLH #lightweight #ml #monad #programming
Lightweight monadic programming in ML (NS, NG, DL, MH), pp. 15–27.
IFLIFL-2011-PerssonAS #embedded #monad
Generic Monadic Constructs for Embedded Languages (AP, EA, JS), pp. 85–99.
GPCEGPCE-J-2005-CaretteK11 #abstraction #monad #multi #programming
Multi-stage programming with functors and monads: Eliminating abstraction overhead from generic code (JC, OK), pp. 349–375.
PPDPPPDP-2011-InabaHHKN #higher-order #logic #monad #using #verification
Graph-transformation verification using monadic second-order logic (KI, SH, ZH, HK, KN), pp. 17–28.
ISSTAISSTA-2011-TateishiPT #analysis #higher-order #logic #monad #string
Path- and index-sensitive string analysis based on monadic second-order logic (TT, MP, OT), pp. 166–176.
FoSSaCSFoSSaCS-2010-AltenkirchCU #monad
Monads Need Not Be Endofunctors (TA, JC, TU), pp. 297–311.
KRKR-2010-CiabattoniR #fuzzy #monad #on the
On the Classical Content of Monadic G with Involutive Negation and its Application to a Fuzzy Medical Expert System (AC, PR).
POPLPOPL-2010-Filinski #monad
Monads in action (AF), pp. 483–494.
CSLCSL-2010-GanzowK #algorithm #higher-order #induction #logic #monad
New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures (TG, LK), pp. 366–380.
LICSLICS-2010-KreutzerT #bound #complexity #higher-order #logic #monad
Lower Bounds for the Complexity of Monadic Second-Order Logic (SK, ST), pp. 189–198.
ESOPESOP-2009-Jaskelioff #composition #monad
Modular Monad Transformers (MJ), pp. 64–79.
FoSSaCSFoSSaCS-2009-AdamekMV #monad
A Description of Iterative Reflections of Monads (Extended Abstract) (JA, SM, JV), pp. 152–166.
PEPMPEPM-2009-PardoFS #higher-order #monad #source code
Shortcut fusion rules for the derivation of circular and higher-order monadic programs (AP, JPF, JS), pp. 81–90.
ICALPICALP-v2-2009-BlumensathOW #bound #finite #higher-order #monad #word
Boundedness of Monadic Second-Order Formulae over Finite Words (AB, MO, MW), pp. 67–78.
LATALATA-2009-BuchseS #datalog #monad #transducer
Monadic Datalog Tree Transducers (MB, TS), pp. 267–278.
LATALATA-2009-Courcelle #algorithm #graph #higher-order #logic #monad
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications (BC), pp. 19–22.
CEFPCEFP-2009-Divianszky #modelling
Non-monadic Models of Mutable References (PD), pp. 146–182.
ICFPICFP-2009-Piponi #commutative #diagrams #monad
Commutative monads, diagrams and knots (DPP), pp. 231–232.
CCCC-2009-BieniusaT #continuation #how #monad
How to CPS Transform a Monad (AB, PT), pp. 266–280.
CSLCSL-2009-Kreutzer #higher-order #logic #monad #on the
On the Parameterised Intractability of Monadic Second-Order Logic (SK), pp. 348–363.
ICALPICALP-A-2008-Courcelle #aspect-oriented #graph #higher-order #logic #monad
Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects (BC), pp. 1–13.
IFLIFL-2008-Jaskelioff #library #monad #named
Monatron: An Extensible Monad Transformer Library (MJ), pp. 233–248.
PPDPPPDP-2008-OlarteV #monad #security
The expressivity of universal timed CCP: undecidability of Monadic FLTL and closure operators for security (CO, FDV), pp. 8–19.
CSLCSL-2008-Thomas #decidability #model transformation #monad #proving
Model Transformations in Decidability Proofs for Monadic Theories (WT), pp. 23–31.
PODSPODS-2007-GottlobPW #bound #datalog #finite #monad
Monadic datalog over finite structures with bounded treewidth (GG, RP, FW), pp. 165–174.
PLDIPLDI-2007-LiZ #concurrent #evaluation #implementation #monad #network #scalability #thread
Combining events and threads for scalable network services implementation and evaluation of monadic, application-level concurrency primitives (PL, SZ), pp. 189–199.
ICALPICALP-2007-KreutzerOS #bound #monad
Boundedness of Monadic FO over Acyclic Structures (SK, MO, NS), pp. 571–582.
PEPMPEPM-2006-SwadiTKP #approach #monad #staging
A monadic approach for avoiding code duplication when staging memoized functions (KNS, WT, OK, EP), pp. 160–169.
ICFPICFP-2006-Lin #monad #programming
Programming monads operationally with Unimo (CKL), pp. 274–285.
LICSLICS-2006-KuskeL #automaton #logic #monad
Monadic Chain Logic Over Iterations and Applications to Pushdown Systems (DK, ML), pp. 91–100.
LICSLICS-2006-Otto #bound #first-order #logic #monad #problem
The Boundedness Problem for Monadic Universal First-Order Logic (MO), pp. 37–48.
RTARTA-2006-Hoffman #equation #monad
Unions of Equational Monadic Theories (PH), pp. 81–95.
ICFPICFP-2005-GhaniJUV #monad
Monadic augment and generalised short cut fusion (NG, PJ, TU, VV), pp. 294–305.
ICFPICFP-2005-KiselyovSFS #backtracking #functional #monad
Backtracking, interleaving, and terminating monad transformers: (functional pearl) (OK, CcS, DPF, AS), pp. 192–203.
GPCEGPCE-2005-CaretteK #abstraction #monad #multi #programming
Multi-stage Programming with Functors and Monads: Eliminating Abstraction Overhead from Generic Code (JC, OK), pp. 256–274.
PPDPPPDP-2005-LopezPPW #concurrent #linear #logic programming #monad
Monadic concurrent linear logic programming (PL, FP, JP, KW), pp. 35–46.
CSLCSL-2005-CourcelleD #composition #graph #higher-order #logic #monad
The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic (BC, CD), pp. 325–338.
TLCATLCA-2005-AehligMO #decidability #higher-order #monad #recursion
The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable (KA, JGdM, CHLO), pp. 39–54.
ICALPICALP-2004-Schweikardt #fixpoint #logic #monad #on the #power of
On the Expressive Power of Monadic Least Fixed Point Logic (NS), pp. 1123–1135.
ICFPICFP-2004-FluetM #monad
Monadic regions (MF, JGM), pp. 103–114.
RTARTA-2004-LevySV #higher-order #monad #unification
Monadic Second-Order Unification Is NP-Complete (JL, MSS, MV), pp. 55–69.
FASEFASE-2003-SchroderM #hoare #independence #logic
Monad-Independent Hoare Logic in HASCASL (LS, TM), pp. 261–277.
FoSSaCSFoSSaCS-2003-MoggiF #metalanguage #monad #multi
A Monadic Multi-stage Metalanguage (EM, SF), pp. 358–374.
ICALPICALP-2003-KlaedtkeR #higher-order #logic #monad
Monadic Second-Order Logics with Cardinalities (FK, HR), pp. 681–696.
CCCC-2003-Danvy #monad #normalisation
A New One-Pass Transformation into Monadic Normal Form (OD), pp. 77–89.
CSLCSL-2003-GroheS #finite #monad #query
Comparing the Succinctness of Monadic Query Languages over Finite Trees (MG, NS), pp. 226–240.
LICSLICS-2003-GurevichS #higher-order #monad
Spectra of Monadic Second-Order Formulas with One Unary Function (YG, SS), pp. 291–300.
PODSPODS-2002-GottlobK #datalog #information management #monad #power of #web
Monadic Datalog and the Expressive Power of Languages for Web Information Extraction (GG, CK), pp. 17–28.
FoSSaCSFoSSaCS-2002-Courcelle #higher-order #monad #semantics
Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations (BC), pp. 1–4.
FoSSaCSFoSSaCS-2002-PlotkinP #monad
Notions of Computation Determine Monads (GDP, JP), pp. 342–356.
FLOPSFLOPS-2002-Hasegawa #continuation #linear #monad #λ-calculus
Linearly Used Effects: Monadic and CPS Transformations into the Linear λ Calculus (MH), pp. 167–182.
ICFPICFP-2002-Carlsson #incremental #monad
Monads for incremental computing (MC), pp. 26–35.
ICFPICFP-2002-LuthG #monad #using
Composing monads using coproducts (CL, NG), pp. 133–144.
LOPSTRLOPSTR-2002-FioravantiPP #higher-order #logic #logic programming #monad #program transformation #source code
Combining Logic Programs and Monadic Second Order Logics by Program Transformation (FF, AP, MP), pp. 160–181.
POPLPOPL-2002-RamseyP #monad #probability #λ-calculus
Stochastic λ calculus and monads of probability distributions (NR, AP), pp. 154–165.
CSLCSL-2002-Goubault-LarrecqLN #logic #monad
Logical Relations for Monadic Types (JGL, SL, DN), pp. 553–568.
LICSLICS-2002-FrickG #complexity #first-order #higher-order #logic #monad #revisited
The Complexity of First-Order and Monadic Second-Order Logic Revisited (MF, MG), pp. 215–224.
LICSLICS-2002-GottlobK #monad #query
Monadic Queries over Tree-Structured Data (GG, CK), pp. 189–202.
VMCAIVMCAI-2002-KrsticM #algorithm #monad #verification
Verifying BDD Algorithms through Monadic Interpretation (SK, JM), pp. 182–195.
FLOPSFLOPS-2001-Kagawa #encapsulation #monad #stack
Monadic Encapsulation with Stack of Regions (KK), pp. 264–279.
DLTDLT-2001-Kuske #axiom #set
Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable (DK), pp. 206–216.
LDTALDTA-2001-GayoDLR #composition #monad #named #prototype #semantics #using
LPS: A Language Prototyping System Using Modular Monadic Semantics (JELG, MCLD, JMCL, ACdR), pp. 110–131.
CSLCSL-2001-Kanovich #linear #logic #monad #power of
The Expressive Power of Horn Monadic Linear Logic (MIK), pp. 39–53.
LICSLICS-2001-ArnoldLM #infinity #monad
The Hierarchy inside Closed Monadic Σ₁ Collapses on the Infinite Binary Tree (AA, GL, JM), pp. 157–166.
LICSLICS-2001-JaninL #calculus #monad #μ-calculus
Relating Levels of the μ-Calculus Hierarchy and Levels of the Monadic Hierarchy (DJ, GL), pp. 347–356.
TLCATLCA-2001-KnapikNU #algebra #monad
Deciding Monadic Theories of Hyperalgebraic Trees (TK, DN, PU), pp. 253–267.
ICFPICFP-2000-ErkokL #monad #recursion
Recursive monadic bindings (LE, JL), pp. 174–185.
ICFPICFP-2000-Hinze #backtracking #monad
Deriving backtracking monad transformers (RH), pp. 186–197.
CAVCAV-2000-AyariB #bound #higher-order #logic #monad
Bounded Model Construction for Monadic Second-Order Logics (AA, DAB), pp. 99–112.
ICALPICALP-1999-EngelfrietH #finite #higher-order #logic #monad #transducer
Two-Way Finite State Transducers and Monadic Second-Order Logic (JE, HJH), pp. 311–320.
ICFPICFP-1999-SemmelrothS #encapsulation #ml #monad
Monadic Encapsulation in ML (MS, AS), pp. 8–17.
POPLPOPL-1999-Filinski #monad #representation
Representing Layered Monads (AF), pp. 175–188.
CSLCSL-1999-AltenkirchR #induction #monad #using
Monadic Presentations of λ Terms Using Generalized Inductive Types (TA, BR), pp. 453–468.
CSLCSL-1999-LautemannW #quantifier #reduction
MonadicNLIN and Quantifier-Free Reductions (CL, BW), pp. 322–337.
STOCSTOC-1998-AjtaiFS #monad
The Closure of Monadic NP (Extended Abstract) (MA, RF, LJS), pp. 309–318.
ICFPICFP-1998-Kieburtz #monad #type system
Taming Effects with Monadic Typing (RBK), pp. 51–62.
ICFPICFP-1998-Scholz #combinator #imperative #library #monad #programming
Imperative Streams — A Monadic Combinator Library for Synchronous Programming (ES), pp. 261–272.
ICFPICFP-1998-Wadler #monad
The Marriage of Effects and Monads (PW), pp. 63–74.
IFLIFL-1998-HolyerS #concurrent #monad
Concurrent Monadic Interfacing (IH, ES), pp. 72–87.
POPLPOPL-1998-AriolaS #calculus #call-by #correctness #imperative #monad
Correctness of Monadic State: An Imperative Call-by-Need Calculus (ZMA, AS), pp. 62–74.
CSLCSL-1998-KreidlerS #graph #monad
Monadic NP and Graph Minors (MK, DS), pp. 126–141.
LICSLICS-1998-Thomas #automaton #logic #monad
Monadic Logic and Automata: Recent Developments (WT), pp. 136–138.
RTARTA-1998-MullerN #constraints #higher-order #logic #monad
Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic (MM, JN), pp. 196–210.
TACASTACAS-1997-KelbMMG #flexibility #higher-order #logic #monad #named #tool support
MOSEL: A FLexible Toolset for Monadic Second-Order Logic (PK, TMS, MM, CG), pp. 183–202.
PLDIPLDI-1997-JensenJKS #automation #higher-order #logic #monad #pointer #source code #using #verification
Automatic Verification of Pointer Programs using Monadic Second-Order Logic (JLJ, MEJ, NK, MIS), pp. 226–236.
ICALPICALP-1997-GurevichV #monad #problem
Monadic Simultaneous Rigid E-Unification and Related Problems (YG, AV), pp. 154–165.
ICFPICFP-1997-LaunchburyS #axiom #monad #type safety
Monadic State: Axiomatization and Type Safety (JL, AS), pp. 227–238.
ICGTGG-Handbook-Vol1-Courcelle #graph transformation #higher-order #logic #monad
The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic (BC), pp. 313–400.
POPLPOPL-1997-ChenH #linear #monad
Rolling Your Own MADT — A Connection Between Linear Types and Monads (CPC, PH), pp. 54–66.
CSLCSL-1997-Schiering #approach #graph #higher-order #logic #monad
A Hierarchical Approach to Monadic Second-Order Logic over Graphs (IS), pp. 424–440.
CSLCSL-1997-Schweikardt #monad #quantifier
The Monadic Quantifier Alternation Hierarchy over Grids and Pictures (NS), pp. 441–460.
CSLCSL-1997-Staiger #higher-order #monad
Rich ω-Words and Monadic Second-Order Arithmetic (LS), pp. 478–490.
LICSLICS-1997-MatzT #graph #infinity #monad #quantifier
The Monadic Quantifier Alternation Hierarchy over Graphs is Infinite (OM, WT), pp. 236–244.
ICALPICALP-1996-Caucal #decidability #graph #infinity #monad #on the
On Infinite Transition Graphs Having a Decidable Monadic Theory (DC), pp. 194–205.
CSLCSL-1996-KreidlerS #monad
Monadic NP and Built-in Trees (MK, DS), pp. 260–275.
LICSLICS-1996-BentonW #linear #logic #monad #λ-calculus
Linear Logic, Monads and the λ Calculus (PNB, PW), pp. 420–431.
TACASTACAS-1995-HenriksenJJKPRS #higher-order #logic #monad #named
Mona: Monadic Second-Order Logic in Practice (JGH, JLJ, MEJ, NK, RP, TR, AS), pp. 89–110.
ICALPICALP-1995-Schwentick #graph #monad
Graph Connectivity, Monadic NP and Built-in Relations of Moderate Degree (TS), pp. 405–416.
AFPAFP-1995-MeijerJ95 #functional #monad #programming
Merging Monads and Folds for Functional Programming (EM, JJ), pp. 228–266.
AFPAFP-1995-Wadler95 #functional #monad #programming
Monads for Functional Programming (PW), pp. 24–52.
POPLPOPL-1995-LiangHJ #composition #monad
Monad Transformers and Modular Interpreters (SL, PH, MPJ), pp. 333–343.
CAVCAV-1995-BasinK #hardware #higher-order #logic #monad #using #verification
Hardware Verification using Monadic Second-Order Logic (DAB, NK), pp. 31–41.
ICLPILPS-1995-BekkersT #logic programming #monad
Monadic Constructs for Logic Programming (YB, PT), pp. 51–65.
LICSLICS-1995-Comon #automaton #higher-order #logic #monad
Sequentiality, Second Order Monadic Logic and Tree Automata (HC), pp. 508–517.
LICSLICS-1995-Jeffrey #concurrent #functional #monad #semantics
A Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types (AJ), pp. 255–264.
ICGTTAGT-1994-Courcelle #composition #graph #higher-order #logic #monad
The Definition in Monadic Second-Order Logic of Modular Decompositions of Ordered Graphs (BC), pp. 487–501.
POPLPOPL-1994-Filinski #monad #representation
Representing Monads (AF), pp. 446–457.
POPLPOPL-1994-Steele #monad
Building Interpreters by Composing Monads (GLSJ), pp. 472–492.
STOCSTOC-1993-FederV #constraints #monad
Monotone monadic SNP and constraint satisfaction (TF, MYV), pp. 612–622.
CSLCSL-1992-Lautemann #logic #monad #problem
Logical Definability of NP-Optimization Problems with Monadic Auxiliary Predicates (CL), pp. 327–339.
CSLCSL-1992-Tyszkiewicz #higher-order #monad #on the
On Asymptotic Probabilities of Monadic Second Order Properties (JT), pp. 425–439.
LICSLICS-1992-Caucal #monad #term rewriting
Monadic Theory of Term Rewritings (DC), pp. 266–273.
ICALPICALP-1991-MadlenerNO #monad #string #term rewriting
A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups (KM, PN, FO), pp. 279–290.
RTARTA-1991-Salomaa #confluence #decidability #monad #term rewriting #termination
Decidability of Confluence and Termination of Monadic Term Rewriting Systems (KS), pp. 275–286.
LISPLFP-1990-Wadler #monad
Comprehending Monads (PW), pp. 61–78.
ICGTGG-1990-Engelfriet #graph #higher-order #logic #monad
A Characterization of Context-Free NCE Graph Languages by Monadic Second-Order Logic on Trees (JE), pp. 311–327.
CSLCSL-1990-ArnborgPS #automaton #higher-order #logic #monad
Monadic Second Order Logic, Tree Automata and Forbidden Minors (SA, AP, DS), pp. 1–16.
LICSLICS-1990-Courcelle #graph #higher-order #monad #on the #set
On the Expression of Monadic Second-Order Graph Properties Without Quantifications Over Sets of Edges (Extended Abstract) (BC), pp. 190–196.
ICALPICALP-1989-Courcelle #equation #graph #higher-order #logic #monad
The Definability of Equational Graphs in Monadic Second-Order Logic (BC), pp. 207–221.
LICSLICS-1989-Moggi #monad #λ-calculus
Computational λ-Calculus and Monads (EM), pp. 14–23.
ICLPNACLP-1989-Wakayama #monad
Monadic Cases: Rediscovering Input Resolution (TW), pp. 115–130.
ICALPICALP-1987-HaferT #logic #monad #quantifier
Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree (TH, WT), pp. 269–279.
ICALPICALP-1986-MullerSS #automaton #complexity #monad
Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity (DEM, AS, PES), pp. 275–283.
ICGTGG-1986-Courcelle86a #graph #higher-order #monad #on the #set
On context-free sets of graphs and their monadic second-order theory (BC), pp. 133–146.
LICSLICS-1986-PerrinS #automaton #decidability #equivalence #integer #monad
Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories (DP, PES), pp. 301–304.
ICALPICALP-1979-Istrail #fixpoint #monad #recursion #semantics #source code #theorem
A Fixed-Point Theorem for Recursive-Enumerable Languages and Some Considerations About Fixed-Point Semantics of Monadic Programs (SI), pp. 289–303.
STOCSTOC-1974-Robertson #complexity #higher-order #monad
Structure of Complexity in the Weak Monadic Second-Order Theories of the Natural Numbers (ELR), pp. 161–171.
ICALPICALP-1974-DilgerR #monad #strict
Monadic Program Schemes Under Restricted Classes of Free Interpretations (WD, PR), pp. 547–561.
ICALPICALP-1972-Dubinsky #monad
The Functions Computed by a Monadic Program Schema with One Location (AD), pp. 521–535.

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.