BibSLEIGH — monad tag

monad

monad

Tag #monad

271 papers:

PADL-2020-Janin: A Timed IO Monad (DJ), pp. 131–147.
POPL-2020-AhrensHLM #reduction: Reduction monads and their signatures (BA, AH, AL, MM), p. 29.
FSCD-2019-AhrensHLM #composition #higher-order #specification: Modular Specification of Monads Through Higher-Order Presentations (BA, AH, AL, MM), p. 19.
Haskell-2019-Ekblad #database #query #relational: Scoping monadic relational database queries (AE), pp. 114–124.
Haskell-2019-ErtelARGC #composition #concurrent #data flow #named #parallel #thread: STCLang: state thread composition as a foundation for monadic dataflow parallelism (SE, JA, NAR, AG, JC), pp. 146–161.
Haskell-2019-SchrijversPWJ #algebra #composition #what: Monad transformers and modular algebraic effects: what binds them together (TS, MP, NW, MJ), pp. 98–113.
ICFP-2019-MaillardAAMHRT: Dijkstra monads for all (KM, DA, RA, GM, CH, ER, ÉT), p. 29.
POPL-2019-Hirschowitz #semantics: Familial monads and structural operational semantics (TH), p. 28.
SLE-2019-CastegrenF #case study #experience #object-oriented: Developing a monadic type checker for an object-oriented language: an experience report (EC, KFR), pp. 184–196.
ICFP-2018-HirschT #lazy evaluation #semantics #strict: Strict and lazy semantics for effects: layering monads and comonads (AKH, RT), p. 30.
ECOOP-2018-InoueAI #domain-specific language #named #workflow: ContextWorkflow: A Monadic DSL for Compensable and Interruptible Executions (HI, TA, AI), p. 33.
POPL-2018-RadicekBG0Z #cost analysis #relational: Monadic refinements for relational cost analysis (IR, GB, MG, DG0, FZ), p. 32.
POPL-2018-TimanySKB #encapsulation #logic #proving: A logical relation for monadic encapsulation of state: proving contextual equivalences in the presence of runST (AT, LS, MKJ, LB), p. 28.
CSL-2018-Kawata #re-engineering: A Contextual Reconstruction of Monadic Reflection (TK), p. 14.
IJCAR-2018-HoAKMTN #synthesis: Proof-Producing Synthesis of CakeML with I/O and Local State from Monadic HOL Functions (SH, OA, RK, MOM, YKT, MN), pp. 646–662.
AFL-2017-SalehiDS #memory management: Generalized Results on Monoids as Memory (ÖS, FD, ACCS), pp. 234–247.
CIAA-2017-FijalkowGKK #automaton #named: Stamina: Stabilisation Monoids in Automata Theory (NF, HG, EK, DK), pp. 101–112.
Haskell-2017-DawsonGG #composition #network: Composable network stacks and remote monads (JD, MG, AG), pp. 86–97.
Haskell-2017-PaykinZ: The linearity Monad (JP, SZ), pp. 117–132.
ICFP-2017-0002KLP #on the #power of: On the expressive power of user-defined effects: effect handlers, monadic reflection, delimited control (YF0, OK, SL, MP), p. 29.
OOPSLA-2017-ScottLDN #composition #parallel: Monadic composition for deterministic, parallel batch processing (RGS, OSNL, JD, RRN), p. 26.
POPL-2017-AhmanHMMPPRS #for free: Dijkstra monads for free (DA, CH, KM, GM, GDP, JP, AR, NS), pp. 515–529.
POPL-2017-DAntoniV #finite #higher-order #logic #sequence: Monadic second-order logic on finite sequences (LD, MV), pp. 232–245.
ESOP-2017-LagoG #probability #termination #type system: Probabilistic Termination by Monadic Affine Sized Typing (UDL, CG), pp. 393–419.
CADE-2017-TeuckeW #constraints #decidability #first-order #linear: Decidability of the Monadic Shallow Linear First-Order Fragment with Straight Dismatching Constraints (AT, CW), pp. 202–219.
DLT-2016-KuskeP #queue: The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids (DK, OP), pp. 256–267.
Haskell-2016-PloegCB #dynamic typing #type safety #type system: The Key monad: type-safe unconstrained dynamic typing (AvdP, KC, PB), pp. 146–157.
ICFP-2016-PirogW #diagrams #for free #functional #string: String diagrams for free monads (functional pearl) (MP, NW), pp. 490–501.
PADL-2016-GrebeG #arduino #named #programming: Haskino: A Remote Monad for Programming the Arduino (MG, AG), pp. 153–168.
PADL-2016-VazouL: From Monads to Effects and Back (NV, DL), pp. 169–186.
CSL-2016-ChenM #constraints #quantifier: Quantified Constraint Satisfaction on Monoids (HC, PM), p. 14.
CSL-2016-KotekVZ #bound #finite #higher-order #satisfiability: Monadic Second Order Finite Satisfiability and Unbounded Tree-Width (TK, HV, FZ), p. 20.
TAP-2016-BruckerW #sequence #testing: Monadic Sequence Testing and Explicit Test-Refinements (ADB, BW), pp. 17–36.
DLT-2015-Bojanczyk: Recognisable Languages over Monads (MB), pp. 1–13.
DLT-2015-BrandlS #analysis #automaton #complexity #finite: Complexity Analysis: Transformation Monoids of Finite Automata (CB, HUS), pp. 143–154.
ICALP-v2-2015-BojanczykMW #bound #clique #datalog #source code: Containment of Monadic Datalog Programs via Bounded Clique-Width (MB, FM, AW), pp. 427–439.
ICALP-v2-2015-MichalewskiM #higher-order #logic #quantifier: Baire Category Quantifier in Monadic Second Order Logic (HM, MM), pp. 362–374.
CEFP-2015-StutterheimAP #source code #visualisation: Static and Dynamic Visualisations of Monadic Programs (JS, PA, RP), pp. 341–379.
Haskell-2015-Foner #functional: Functional pearl: getting a quick fix on comonads (KF), pp. 106–117.
Haskell-2015-GillSDEFGRSS #design pattern: The remote monad design pattern (AG, NS, JD, AE, AF, MG, JR, RS, JS), pp. 59–70.
Haskell-2015-KiselyovI: Freer monads, more extensible effects (OK, HI), pp. 94–105.
Haskell-2015-ScibiorGG #probability #programming: Practical probabilistic programming with monads (AS, ZG, ADG), pp. 165–176.
BX-2015-JohnsonRa: Distributing Commas, and the Monad of Anchored Spans (MJ, RR), pp. 31–42.
POPL-2015-JungSSSTBD #concurrent #invariant #named #orthogonal #reasoning: Iris: Monoids and Invariants as an Orthogonal Basis for Concurrent Reasoning (RJ, DS, FS, KS, AT, LB, DD), pp. 637–650.
PPDP-2015-RivasJS: From monoids to near-semirings: the essence of MonadPlus and alternative (ER, MJ, TS), pp. 196–207.
CSL-2015-KuskeLM #decidability #infinity #word: Infinite and Bi-infinite Words with Decidable Monadic Theories (DK, JL, AM), pp. 472–486.
LICS-2015-EnqvistSV #algebra #bisimulation #higher-order #logic: Monadic Second-Order Logic and Bisimulation Invariance for Coalgebras (SE, FS, YV), pp. 353–365.
LICS-2015-McIverMR #data flow #markov #modelling: Abstract Hidden Markov Models: A Monadic Account of Quantitative Information Flow (AM, CM, TMR), pp. 597–608.
ICALP-v2-2014-GoncharovP #algebra #bisimulation #equation #recursion: Coalgebraic Weak Bisimulation from Recursive Equations over Monads (SG, DP), pp. 196–207.
Haskell-2014-PloegK #sequence: Reflection without remorse: revealing a hidden sequence to speed up monadic reflection (AvdP, OK), pp. 133–144.
ICGT-2014-PoskittP #graph #higher-order #source code #verification: Verifying Monadic Second-Order Properties of Graph Programs (CMP, DP), pp. 33–48.
CHI-2014-DorkCD: Monadic exploration: seeing the whole through its parts (MD, RC, MDR), pp. 1535–1544.
BX-2014-CheneyMSGA: Entangled State Monads (JC, JM, PS, JG, FAS), pp. 108–111.
PADL-2014-BrackerG #domain-specific language #generative #javascript #named: Sunroof: A Monadic DSL for Generating JavaScript (JB, AG), pp. 65–80.
PEPM-2014-PachecoHF #bidirectional #combinator #programming: Monadic combinators for “Putback” style bidirectional programming (HP, ZH, SF), pp. 39–50.
POPL-2014-Katsumata #parametricity #semantics: Parametric effect monads and semantics of effect systems (SyK), pp. 633–646.
CAV-2014-VeanesBNB #composition: Monadic Decomposition (MV, NB, LN, SB), pp. 628–645.
LICS-CSL-2014-Mamouras #hoare #on the #recursion: On the Hoare theory of monadic recursion schemes (KM), p. 10.
RTA-2013-GuiraudMM #topic: A Homotopical Completion Procedure with Applications to Coherence of Monoids (YG, PM, SM), pp. 223–238.
Haskell-2013-BlaEevic #haskell #string: Adding structure to monoids: thus hopefully ending Haskell's string type confusion (MB), pp. 37–46.
Haskell-2013-KiselyovSS: Extensible effects: an alternative to monad transformers (OK, AS, CS), pp. 59–70.
Haskell-2013-Ploeg #functional #programming: Monadic functional reactive programming (AvdP), pp. 117–128.
ICFP-2013-DelawareKSO #composition: Modular monadic meta-theory (BD, SK, TS, BCdSO), pp. 319–330.
ICFP-2013-SvenningssonS #composition #embedded: Simple and compositional reification of monadic embedded languages (JS, BJS), pp. 299–304.
ICFP-2013-ZilianiDKNV #coq #named #programming: Mtac: a monad for typed tactic programming in Coq (BZ, DD, NRK, AN, VV), pp. 87–100.
GCM-J-2012-Radke #graph #higher-order: HR* Graph Conditions Between Counting Monadic Second-Order and Second-Order Graph Formulas (HR).
PLDI-2013-SergeyDMMDCP: Monadic abstract interpreters (IS, DD, MM, JM, DD, DC, FP), pp. 399–410.
PLDI-2013-SwamyWSCL #higher-order #source code #verification: Verifying higher-order programs with the dijkstra monad (NS, JW, CS, JC, BL), pp. 387–398.
PPDP-2013-AsadaHKHN #branch #calculus #finite #graph #graph transformation: A parameterized graph transformation calculus for finite graphs with monadic branches (KA, SH, HK, ZH, KN), pp. 73–84.
PLOS-2013-DzikPRTV #in the cloud #named: MBrace: cloud computing with monads (JD, NP, KR, ET, NV), p. 6.
ESOP-2013-ToninhoCP #higher-order #integration #process: Higher-Order Processes, Functions, and Sessions: A Monadic Integration (BT, LC, FP), pp. 350–369.
FoSSaCS-2013-BauerHK #higher-order #on the #parametricity: On Monadic Parametricity of Second-Order Functionals (AB, MH, AK), pp. 225–240.
FoSSaCS-2013-KatsumataS #algebra #simulation: Preorders on Monads and Coalgebraic Simulations (SyK, TS), pp. 145–160.
CSL-2013-Maruyama #category theory: Categorical Duality Theory: With Applications to Domains, Convexity, and the Distribution Monad (YM), pp. 500–520.
LICS-2013-AlurDT #higher-order #string #transducer: From Monadic Second-Order Definable String Transformations to Transducers (RA, ADG, AT), pp. 458–467.
LICS-2013-Colcombet #logic #set #using #word: Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory (TC), p. 123.
LICS-2013-KreutzerR #higher-order #logic: Quantitative Monadic Second-Order Logic (SK, CR), pp. 113–122.
ICALP-v2-2012-BenediktBS #datalog: Monadic Datalog Containment (MB, PB, PS), pp. 79–91.
Haskell-2012-Yorgey #functional #named: Monoids: theme and variations (functional pearl) (BAY), pp. 105–116.
ICFP-2012-Danielsson #semantics #using: Operational semantics using the partiality monad (NAD), pp. 127–138.
ICFP-2012-Huffman #verification: Formal verification of monad transformers (BH), pp. 15–16.
IFL-2012-OrchardM: A Notation for Comonads (DAO, AM), pp. 1–17.
OOPSLA-2012-BocqD #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.
FoSSaCS-2012-AhmanCU #question: When Is a Container a Comonad? (DA, JC, TU), pp. 74–88.
IJCAR-2012-Brock-NannestadS #abstraction: Truthful Monadic Abstractions (TBN, CS), pp. 97–110.
LICS-2012-AdamekMBL #set: Coproducts of Monads on Set (JA, SM, NB, PBL), pp. 45–54.
LICS-2012-ElberfeldGT #first-order #higher-order #logic: Where First-Order and Monadic Second-Order Logic Coincide (ME, MG, TT), pp. 265–274.
LICS-2012-EngelmannKS #first-order #higher-order #model checking: First-Order and Monadic Second-Order Model-Checking on Ordered Structures (VE, SK, SS), pp. 275–284.
CIAA-J-2010-DrosteM11 #automaton #regular expression: Weighted Automata and Regular Expressions over Valuation Monoids (MD, IM), pp. 1829–1844.
ICALP-v2-2011-Zetzsche #automaton #on the #transducer: On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids (GZ), pp. 222–233.
LATA-2011-CorranHKT #automation #finite: Singular Artin Monoids of Finite Coxeter Type Are Automatic (RC, MH, DK, RMT), pp. 250–261.
Haskell-2011-GiorgidzeGSW: Bringing back monad comprehensions (GG, TG, NS, JW), pp. 13–22.
Haskell-2011-MarlowNJ #parallel: A monad for deterministic parallelism (SM, RN, SLPJ), pp. 71–82.
Haskell-2011-PetricekMS #pattern matching: Extending monads with pattern matching (TP0, AM, DS), pp. 1–12.
ICFP-2011-Filinski #towards: Towards a comprehensive theory of monadic effects (AF), p. 1.
ICFP-2011-GibbonsH #equation #reasoning: Just do it: simple monadic equational reasoning (JG, RH), pp. 2–14.
ICFP-2011-SchrijversO #stack: Monads, zippers and views: virtualizing the monad stack (TS, BCdSO), pp. 32–44.
ICFP-2011-SwamyGLH #lightweight #ml #programming: Lightweight monadic programming in ML (NS, NG, DL, MH), pp. 15–27.
IFL-2011-PerssonAS #embedded: Generic Monadic Constructs for Embedded Languages (AP, EA, JS), pp. 85–99.
BX-2011-Gibbons1 #algebra #lens: Lenses are Coalgebras for the Costate Comonad (JG), p. 56.
PPDP-2011-InabaHHKN #higher-order #logic #using #verification: Graph-transformation verification using monadic second-order logic (KI, SH, ZH, HK, KN), pp. 17–28.
GPCE-J-2005-CaretteK11 #abstraction #multi #programming: Multi-stage programming with functors and monads: Eliminating abstraction overhead from generic code (JC, OK), pp. 349–375.
ISSTA-2011-TateishiPT #analysis #higher-order #logic #string: Path- and index-sensitive string analysis based on monadic second-order logic (TT, MP, OT), pp. 166–176.
LICS-2011-GoncharovS: Powermonads and Tensors of Unranked Effects (SG, LS), pp. 227–236.
KR-2010-CiabattoniR #fuzzy #on the: On the Classical Content of Monadic G with Involutive Negation and its Application to a Fuzzy Medical Expert System (AC, PR).
POPL-2010-Filinski: Monads in action (AF), pp. 483–494.
FoSSaCS-2010-AltenkirchCU: Monads Need Not Be Endofunctors (TA, JC, TU), pp. 297–311.
CSL-2010-GanzowK #algorithm #higher-order #induction #logic: New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures (TG, LK), pp. 366–380.
LICS-2010-KreutzerT #bound #complexity #higher-order #logic: Lower Bounds for the Complexity of Monadic Second-Order Logic (SK, ST), pp. 189–198.
ICALP-v2-2009-BeaudryL: Faithful Loops for Aperiodic E-Ordered Monoids (MB, FL), pp. 55–66.
ICALP-v2-2009-BlumensathOW #bound #finite #higher-order #word: Boundedness of Monadic Second-Order Formulae over Finite Words (AB, MO, MW), pp. 67–78.
ICALP-v2-2009-Colcombet #cost analysis #formal method: The Theory of Stabilisation Monoids and Regular Cost Functions (TC), pp. 139–150.
LATA-2009-BuchseS #datalog #transducer: Monadic Datalog Tree Transducers (MB, TS), pp. 267–278.
LATA-2009-Courcelle #algorithm #graph #higher-order #logic: Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications (BC), pp. 19–22.
ICFP-2009-Piponi #commutative #diagrams: Commutative monads, diagrams and knots (DPP), pp. 231–232.
PEPM-2009-PardoFS #higher-order #source code: Shortcut fusion rules for the derivation of circular and higher-order monadic programs (AP, JPF, JS), pp. 81–90.
CC-2009-BieniusaT #continuation #how: How to CPS Transform a Monad (AB, PT), pp. 266–280.
ESOP-2009-Jaskelioff #composition: Modular Monad Transformers (MJ), pp. 64–79.
FoSSaCS-2009-AdamekMV: A Description of Iterative Reflections of Monads (JA, SM, JV), pp. 152–166.
CSL-2009-Kreutzer #higher-order #logic #on the: On the Parameterised Intractability of Monadic Second-Order Logic (SK), pp. 348–363.
DLT-J-2007-BertoniR08 #approximate: Approximating the Mean Speedup in Trace Monoids (AB, RR), pp. 497–511.
ICALP-A-2008-Courcelle #aspect-oriented #graph #higher-order #logic: Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects (BC), pp. 1–13.
Haskell-2008-KariotisPH #haskell: Making monads first-class with template haskell (PSK, AMP, WLH), pp. 99–110.
Haskell-2008-KiselyovS #lightweight: Lightweight monadic regions (OK, CcS), pp. 1–12.
IFL-2008-Jaskelioff #library #named: Monatron: An Extensible Monad Transformer Library (MJ), pp. 233–248.
PPDP-2008-OlarteV #security: The expressivity of universal timed CCP: undecidability of Monadic FLTL and closure operators for security (CO, FDV), pp. 8–19.
CSL-2008-Thomas #decidability #model transformation #proving: Model Transformations in Decidability Proofs for Monadic Theories (WT), pp. 23–31.
PODS-2007-GottlobPW #bound #datalog #finite: Monadic datalog over finite structures with bounded treewidth (GG, RP, FW), pp. 165–174.
DLT-2007-BertoniR: Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids (AB, RR), pp. 72–83.
ICALP-2007-KreutzerOS #bound: Boundedness of Monadic FO over Acyclic Structures (SK, MO, NS), pp. 571–582.
PLDI-2007-LiZ #concurrent #evaluation #implementation #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.
RTA-2006-Hoffman #equation: Unions of Equational Monadic Theories (PH), pp. 81–95.
ICFP-2006-Lin #programming: Programming monads operationally with Unimo (CKL), pp. 274–285.
PEPM-2006-SwadiTKP #approach #staging: A monadic approach for avoiding code duplication when staging memoized functions (KNS, WT, OK, EP), pp. 160–169.
LICS-2006-KuskeL #automaton #logic: Monadic Chain Logic Over Iterations and Applications to Pushdown Systems (DK, ML), pp. 91–100.
LICS-2006-Otto #bound #first-order #logic #problem: The Boundedness Problem for Monadic Universal First-Order Logic (MO), pp. 37–48.
CIAA-J-2004-KrawetzLS05 #complexity #finite #set: State complexity and the monoid of transformations of a finite set (BK, JL, JS), pp. 547–563.
DLT-J-2004-Lohrey05 #automation #complexity #decidability: Decidability and complexity in automatic monoids (ML), pp. 707–722.
TLCA-2005-AehligMO #decidability #higher-order #recursion: The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable (KA, JGdM, CHLO), pp. 39–54.
ICFP-2005-GhaniJUV: Monadic augment and generalised short cut fusion (NG, PJ, TU, VV), pp. 294–305.
ICFP-2005-KiselyovSFS #backtracking: Backtracking, interleaving, and terminating monad transformers: (OK, CcS, DPF, AS), pp. 192–203.
PPDP-2005-LopezPPW #concurrent #linear #logic programming: Monadic concurrent linear logic programming (PL, FP, JP, KW), pp. 35–46.
GPCE-2005-CaretteK #abstraction #multi #programming: Multi-stage Programming with Functors and Monads: Eliminating Abstraction Overhead from Generic Code (JC, OK), pp. 256–274.
CSL-2005-CourcelleD #composition #graph #higher-order #logic: The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic (BC, CD), pp. 325–338.
CIAA-2004-KrawetzLS #complexity #finite #set: State Complexity and the Monoid of Transformations of a Finite Set (BK, JL, JS), pp. 213–224.
DLT-2004-Lohrey #automation #complexity #decidability: Decidability and Complexity in Automatic Monoids (ML), pp. 308–320.
ICALP-2004-Schweikardt #fixpoint #logic #on the #power of: On the Expressive Power of Monadic Least Fixed Point Logic (NS), pp. 1123–1135.
RTA-2004-LevySV #higher-order #unification: Monadic Second-Order Unification Is NP-Complete (JL, MSS, MV), pp. 55–69.
ICFP-2004-FluetM: Monadic regions (MF, JGM), pp. 103–114.
DLT-2003-HolzerK #automaton #finite #on the: On Deterministic Finite Automata and Syntactic Monoid Size, Continued (MH, BK), pp. 349–360.
ICALP-2003-KlaedtkeR #higher-order #logic: Monadic Second-Order Logics with Cardinalities (FK, HR), pp. 681–696.
CC-2003-Danvy #normalisation: A New One-Pass Transformation into Monadic Normal Form (OD), pp. 77–89.
FoSSaCS-2003-MoggiF #metalanguage #multi: A Monadic Multi-stage Metalanguage (EM, SF), pp. 358–374.
CSL-2003-GroheS #finite #query: Comparing the Succinctness of Monadic Query Languages over Finite Trees (MG, NS), pp. 226–240.
LICS-2003-GurevichS #higher-order: Spectra of Monadic Second-Order Formulas with One Unary Function (YG, SS), pp. 291–300.
PODS-2002-GottlobK #datalog #information management #power of #web: Monadic Datalog and the Expressive Power of Languages for Web Information Extraction (GG, CK), pp. 17–28.
DLT-2002-Esik #finite #generative #logic #word: Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators (ZÉ), pp. 43–58.
DLT-2002-HolzerK02a #automaton #finite #on the: On Deterministic Finite Automata and Syntactic Monoid Size (MH, BK), pp. 258–269.
ICALP-2002-KuskeL #formal method #on the: On the Theory of One-Step Rewriting in Trace Monoids (DK, ML), pp. 752–763.
FLOPS-2002-Hasegawa #continuation #linear #λ-calculus: Linearly Used Effects: Monadic and CPS Transformations into the Linear λ Calculus (MH), pp. 167–182.
ICFP-2002-Carlsson #incremental: Monads for incremental computing (MC), pp. 26–35.
ICFP-2002-LuthG #using: Composing monads using coproducts (CL, NG), pp. 133–144.
LOPSTR-2002-FioravantiPP #higher-order #logic #logic programming #program transformation #source code: Combining Logic Programs and Monadic Second Order Logics by Program Transformation (FF, AP, MP), pp. 160–181.
POPL-2002-RamseyP #probability #λ-calculus: Stochastic λ calculus and monads of probability distributions (NR, AP), pp. 154–165.
FoSSaCS-2002-Courcelle #higher-order #semantics: Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations (BC), pp. 1–4.
FoSSaCS-2002-PlotkinP: Notions of Computation Determine Monads (GDP, JP), pp. 342–356.
CSL-2002-Goubault-LarrecqLN #logic: Logical Relations for Monadic Types (JGL, SL, DN), pp. 553–568.
LICS-2002-FrickG #complexity #first-order #higher-order #logic #revisited: The Complexity of First-Order and Monadic Second-Order Logic Revisited (MF, MG), pp. 215–224.
LICS-2002-GottlobK #query: Monadic Queries over Tree-Structured Data (GG, CK), pp. 189–202.
VMCAI-2002-KrsticM #algorithm #verification: Verifying BDD Algorithms through Monadic Interpretation (SK, JM), pp. 182–195.
ICALP-2001-Kirsten #problem #reduction: The Star Problem in Trace Monoids: Reductions Beyond C4 (DK), pp. 591–602.
TLCA-2001-KnapikNU #algebra: Deciding Monadic Theories of Hyperalgebraic Trees (TK, DN, PU), pp. 253–267.
FLOPS-2001-Kagawa #encapsulation #stack: Monadic Encapsulation with Stack of Regions (KK), pp. 264–279.
LDTA-2001-GayoDLR #composition #named #prototype #semantics #using: LPS: A Language Prototyping System Using Modular Monadic Semantics (JELG, MCLD, JMCL, ACdR), pp. 110–131.
CSL-2001-Kanovich #linear #logic #power of: The Expressive Power of Horn Monadic Linear Logic (MIK), pp. 39–53.
LICS-2001-ArnoldLM #infinity: The Hierarchy inside Closed Monadic Σ₁ Collapses on the Infinite Binary Tree (AA, GL, JM), pp. 157–166.
LICS-2001-GodoyN #constraints #deduction #on the: On Ordering Constraints for Deduction with Built-In Abelian Semigroups, Monoids and Groups (GG, RN), pp. 38–47.
LICS-2001-JaninL #calculus #μ-calculus: Relating Levels of the μ-Calculus Hierarchy and Levels of the Monadic Hierarchy (DJ, GL), pp. 347–356.
WLC-2000-Inata: Presentations of Right Unitary Submonoids of Monoids (II), pp. 222–227.
WLC-2000-KelarevT #combinator: A Combinatorial Property of Languages and Monoids (AVK, PGT), pp. 228–239.
ICFP-2000-ErkokL #recursion: Recursive monadic bindings (LE, JL), pp. 174–185.
ICFP-2000-Hinze #backtracking: Deriving backtracking monad transformers (RH), pp. 186–197.
CAV-2000-AyariB #bound #higher-order #logic: Bounded Model Construction for Monadic Second-Order Logics (AA, DAB), pp. 99–112.
ICALP-1999-EngelfrietH #finite #higher-order #logic #transducer: Two-Way Finite State Transducers and Monadic Second-Order Logic (JE, HJH), pp. 311–320.
ICALP-1999-Kirsten #finite #problem: A Connection between the Star Problem and the Finite Power Property in Trace Monoids (DK), pp. 473–482.
ICFP-1999-SemmelrothS #encapsulation #ml: Monadic Encapsulation in ML (MS, AS), pp. 8–17.
POPL-1999-Filinski #representation: Representing Layered Monads (AF), pp. 175–188.
CSL-1999-AltenkirchR #induction #using: Monadic Presentations of λ Terms Using Generalized Inductive Types (TA, BR), pp. 453–468.
RTA-1998-MullerN #constraints #higher-order #logic: Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic (MM, JN), pp. 196–210.
RTA-1998-OttoSM #automation #convergence #finite: Automatic Monoids Versus Monoids with Finite Convergent Presentations (FO, ASK, KM), pp. 32–46.
ICFP-1998-Kieburtz #type system: Taming Effects with Monadic Typing (RBK), pp. 51–62.
ICFP-1998-Scholz #combinator #imperative #library #programming: Imperative Streams — A Monadic Combinator Library for Synchronous Programming (ES), pp. 261–272.
ICFP-1998-Wadler: The Marriage of Effects and Monads (PW), pp. 63–74.
IFL-1998-HolyerS #concurrent: Concurrent Monadic Interfacing (IH, ES), pp. 72–87.
POPL-1998-AriolaS #calculus #call-by #correctness #imperative: Correctness of Monadic State: An Imperative Call-by-Need Calculus (ZMA, AS), pp. 62–74.
STOC-1998-AjtaiFS: The Closure of Monadic NP (MA, RF, LJS), pp. 309–318.
CSL-1998-KreidlerS #graph: Monadic NP and Graph Minors (MK, DS), pp. 126–141.
LICS-1998-Thomas #automaton #logic: Monadic Logic and Automata: Recent Developments (WT), pp. 136–138.
ICALP-1997-GurevichV #problem: Monadic Simultaneous Rigid E-Unification and Related Problems (YG, AV), pp. 154–165.
RTA-1997-OttoKK #decidability #problem #word: Cross-Sections for Finitely Presented Monoids with Decidable Word Problems (FO, MK, YK), pp. 53–67.
RTA-1997-Sattler-Klein: New Undecidablility Results for Finitely Presented Monoids (ASK), pp. 68–82.
ICFP-1997-LaunchburyS #axiom #type safety: Monadic State: Axiomatization and Type Safety (JL, AS), pp. 227–238.
GG-Handbook-Vol1-Courcelle #graph transformation #higher-order #logic: The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic (BC), pp. 313–400.
PLDI-1997-JensenJKS #automation #higher-order #logic #pointer #source code #using #verification: Automatic Verification of Pointer Programs using Monadic Second-Order Logic (JLJ, MEJ, NK, MIS), pp. 226–236.
POPL-1997-ChenH #linear: Rolling Your Own MADT — A Connection Between Linear Types and Monads (CPC, PH), pp. 54–66.
TACAS-1997-KelbMMG #flexibility #higher-order #logic #named #tool support: MOSEL: A FLexible Toolset for Monadic Second-Order Logic (PK, TMS, MM, CG), pp. 183–202.
CSL-1997-Schiering #approach #graph #higher-order #logic: A Hierarchical Approach to Monadic Second-Order Logic over Graphs (IS), pp. 424–440.
CSL-1997-Schweikardt #quantifier: The Monadic Quantifier Alternation Hierarchy over Grids and Pictures (NS), pp. 441–460.
CSL-1997-Staiger #higher-order: Rich ω-Words and Monadic Second-Order Arithmetic (LS), pp. 478–490.
LICS-1997-MatzT #graph #infinity #quantifier: The Monadic Quantifier Alternation Hierarchy over Graphs is Infinite (OM, WT), pp. 236–244.
ICALP-1996-Caucal #decidability #graph #infinity #on the: On Infinite Transition Graphs Having a Decidable Monadic Theory (DC), pp. 194–205.
RTA-1996-Madlener: Applications of Rewrite Techniques in Monoids and Rings (KM), p. 260.
CADE-1996-GanzingerW #proving #theorem proving: Theorem Proving in Cancellative Abelian Monoids (HG, UW), pp. 388–402.
CSL-1996-KreidlerS: Monadic NP and Built-in Trees (MK, DS), pp. 260–275.
CSL-1996-Statman #on the: On Cartesian Monoids (RS), pp. 446–459.
LICS-1996-BentonW #linear #logic #λ-calculus: Linear Logic, Monads and the λ Calculus (PNB, PW), pp. 420–431.
ICALP-1995-Schwentick #graph: Graph Connectivity, Monadic NP and Built-in Relations of Moderate Degree (TS), pp. 405–416.
RTA-1995-Gehrke #category theory #concept #problem: Problems in Rewriting Applied to Categorical Concepts by the Example of a Computational Comonad (WG), pp. 210–224.
AFP-1995-MeijerJ95 #functional #programming: Merging Monads and Folds for Functional Programming (EM, JJ), pp. 228–266.
AFP-1995-Wadler95 #functional #programming: Monads for Functional Programming (PW), pp. 24–52.
POPL-1995-LiangHJ #composition: Monad Transformers and Modular Interpreters (SL, PH, MPJ), pp. 333–343.
TACAS-1995-HenriksenJJKPRS #higher-order #logic #named: Mona: Monadic Second-Order Logic in Practice (JGH, JLJ, MEJ, NK, RP, TR, AS), pp. 89–110.
CAV-1995-BasinK #hardware #higher-order #logic #using #verification: Hardware Verification using Monadic Second-Order Logic (DAB, NK), pp. 31–41.
ILPS-1995-BekkersT #logic programming: Monadic Constructs for Logic Programming (YB, PT), pp. 51–65.
LICS-1995-Comon #automaton #higher-order #logic: Sequentiality, Second Order Monadic Logic and Tree Automata (HC), pp. 508–517.
LICS-1995-Jeffrey #concurrent #functional #semantics: A Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types (AJ), pp. 255–264.
ICALP-1994-Droste #concurrent #theorem: A KLeene Theorem for Recognizable Languages over Concurrency Monoids (MD), pp. 388–399.
TAGT-1994-Courcelle #composition #graph #higher-order #logic: The Definition in Monadic Second-Order Logic of Modular Decompositions of Ordered Graphs (BC), pp. 487–501.
POPL-1994-Filinski #representation: Representing Monads (AF), pp. 446–457.
POPL-1994-Steele: Building Interpreters by Composing Monads (GLSJ), pp. 472–492.
RTA-1993-Adian #algorithm #on the #problem: On some Algorithmic Problems for Groups and Monoids (SIA), pp. 289–300.
STOC-1993-FederV #constraints: Monotone monadic SNP and constraint satisfaction (TF, MYV), pp. 612–622.
TAPSOFT-1993-BellegardeH: Monads, Indexes and Transformations (FB, JH), pp. 314–327.
CSL-1992-Lautemann #logic #problem: Logical Definability of NP-Optimization Problems with Monadic Auxiliary Predicates (CL), pp. 327–339.
CSL-1992-Tyszkiewicz #higher-order #on the: On Asymptotic Probabilities of Monadic Second Order Properties (JT), pp. 425–439.
LICS-1992-Caucal #term rewriting: Monadic Theory of Term Rewritings (DC), pp. 266–273.
ICALP-1991-DuchampK #commutative: Lazard’s Factorizations of Free Partially Commutative Monoids (GD, DK), pp. 242–253.
ICALP-1991-MadlenerNO #string #term rewriting: A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups (KM, PN, FO), pp. 279–290.
RTA-1991-Salomaa #confluence #decidability #term rewriting #termination: Decidability of Confluence and Termination of Monadic Term Rewriting Systems (KS), pp. 275–286.
LICS-1991-Statman #combinator: Freyd’s Hierarchy of Combinator Monoids (RS), pp. 186–190.
LFP-1990-Wadler: Comprehending Monads (PW), pp. 61–78.
GG-1990-Engelfriet #graph #higher-order #logic: A Characterization of Context-Free NCE Graph Languages by Monadic Second-Order Logic on Trees (JE), pp. 311–327.
CSL-1990-ArnborgPS #automaton #higher-order #logic: Monadic Second Order Logic, Tree Automata and Forbidden Minors (SA, AP, DS), pp. 1–16.
LICS-1990-Courcelle #graph #higher-order #on the #set: On the Expression of Monadic Second-Order Graph Properties Without Quantifications Over Sets of Edges (BC), pp. 190–196.
ICALP-1989-Courcelle #equation #graph #higher-order #logic: The Definability of Equational Graphs in Monadic Second-Order Logic (BC), pp. 207–221.
RTA-1989-Pedersen: Morphocompletion for One-Relation Monoids (JP), pp. 574–578.
CAAP-1989-Badouel #infinity: Terms and Infinite Trees as Monads Over a Signature (EB), pp. 89–103.
LICS-1989-Moggi #λ-calculus: Computational λ-Calculus and Monads (EM), pp. 14–23.
NACLP-1989-Wakayama: Monadic Cases: Rediscovering Input Resolution (TW), pp. 115–130.
ICALP-1988-Diekert #commutative #for free #transitive: Transitive Orientations, Möbius Functions, and Complete Semi-Thue Systems for Free Partially Commutative Monoids (VD), pp. 176–187.
LICS-1988-MeseguerM #algebra #petri net: Petri Nets Are Monoids: A New Algebraic Foundation for Net Theory (JM, UM), pp. 155–164.
ICALP-1987-ChoffrutD #problem: A Star-Height Problem in Free Monoids with Partial Communications (CC, CD), pp. 190–201.
ICALP-1987-HaferT #logic #quantifier: Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree (TH, WT), pp. 269–279.
RTA-1987-SquierO #canonical #finite #problem #term rewriting #word: Th Word Problem for Finitely Presented Monoids and Finite Canonical Rewriting Systems (CCS, FO), pp. 74–82.
STOC-1987-BarringtonT #finite: Finite Monoids and the Fine Structure of NC¹ (DAMB, DT), pp. 101–109.
ICALP-1986-Metivier #commutative #on the #set: On Recognizable Subsets of Free Partially Commutative Monoids (YM), pp. 254–264.
ICALP-1986-MullerSS #automaton #complexity: Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity (DEM, AS, PES), pp. 275–283.
GG-1986-Courcelle86a #graph #higher-order #on the #set: On context-free sets of graphs and their monadic second-order theory (BC), pp. 133–146.
LICS-1986-PerrinS #automaton #decidability #equivalence #integer: Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories (DP, PES), pp. 301–304.
ICALP-1985-Pin #finite #for free: Finite Group Topology and p-Adic Topology for Free Monoids (JÉP), pp. 445–455.
RTA-1985-Otto #algebra #finite: Deciding Algebraic Properties of Monoids Presented by Finite Church-Rosser Thue Systems (FO), pp. 95–106.
ICALP-1983-Karhumaki: A Note on Intersections of Free Submonoids of a Free Monoid (JK), pp. 397–407.
ICALP-1979-Istrail #fixpoint #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.
ICALP-1978-Restivo #set: Some Decision Results for Recognizable Sets in Arbitrary Monoids (AR), pp. 363–371.
GG-1978-ArbibM #algebra #recursion #semantics: Partially-Additive Monoids, Graph-Growing, and the Algebraic Semantics of Recursive Calls (MAA, EGM), pp. 127–138.
POPL-1978-Rosen #agile #analysis #data flow: Monoids for Rapid Data Flow Analysis (BKR), pp. 47–59.
ICALP-1974-DilgerR #strict: Monadic Program Schemes Under Restricted Classes of Free Interpretations (WD, PR), pp. 547–561.
STOC-1974-Robertson #complexity #higher-order: Structure of Complexity in the Weak Monadic Second-Order Theories of the Natural Numbers (ELR), pp. 161–171.
ICALP-1972-Dubinsky: The Functions Computed by a Monadic Program Schema with One Location (AD), pp. 521–535.
ICALP-1972-Lentin #equation: Equations in Free Monoids (AL), pp. 67–85.
STOC-1970-Perrot #automaton #finite #on the: On The Relationship between Finite Automata, Finite Monoids, and Prefix Codes (JFP), pp. 217–220.