BibSLEIGH — calculus tag

calculus

calculus

Tag #calculus

625 papers:

CSL-2020-DemriLM #logic: Internal Calculi for Separation Logics (SD, ÉL, AM), p. 18.
FSCD-2019-CiaffaglioneGHL #exclamation: lambda!-calculus, Intersection Types, and Involutions (AC, PDG, FH, ML, IS), p. 16.
FSCD-2019-LiquoriS #syntax: The Delta-calculus: Syntax and Types (LL, CS), p. 20.
ICFP-2019-BahrGM #programming: Simply RaTT: a fitch-style modal calculus for reactive programming without space leaks (PB, CG, REM), p. 27.
PLDI-2019-LiaoHM #composition #encryption #named: ILC: a calculus for composable, computational cryptography (KL, MAH, AM0), pp. 640–654.
POPL-2019-FlorenceYTF: A calculus for Esterel: if can, can. if no can, no can (SPF, SHY, JAT, RBF), p. 29.
CADE-2019-CassanoFHAC #logic: A Tableaux Calculus for Default Intuitionistic Logic (VC, RF, GH, CA, PFC), pp. 161–177.
CADE-2019-Plaisted: The Aspect Calculus (DAP), pp. 406–424.
KDD-2018-CobbEMR #identification #multi #process: Identifying Sources and Sinks in the Presence of Multiple Agents with Gaussian Process Vector Calculus (ADC, RE, AM, SJR), pp. 1254–1262.
PLDI-2018-BowmanA: Typed closure conversion for the calculus of constructions (WJB, AA), pp. 797–811.
IJCAR-2018-LettmannP #proving: A Tableaux Calculus for Reducing Proof Size (MPL, NP), pp. 64–80.
IJCAR-2018-NalonP #logic: A Resolution-Based Calculus for Preferential Logics (CN, DP), pp. 498–515.
CIAA-2017-CauliP #equivalence #probability #μ-calculus: Equivalence of Probabilistic μ-Calculus and p-Automata (CC, NP), pp. 64–75.
FSCD-2017-BarenbaumB #linear: Optimality and the Linear Substitution Calculus (PB, EB), p. 16.
FSCD-2017-KanovichKMS #algorithm #bound #order #polynomial: A Polynomial-Time Algorithm for the Lambek Calculus with Brackets of Bounded Order (MIK, SK, GM, AS), p. 17.
FSCD-2017-Zeilberger: A Sequent Calculus for a Semi-Associative Law (NZ), p. 16.
SEFM-2017-MatteplackelPW #diagrams #formal method #requirements: Formalizing Timing Diagram Requirements in Discrete Duration Calculus (RMM, PKP, AW), pp. 253–268.
ICFP-2017-Hamana #algebra #decidability #higher-order #how: How to prove your calculus is decidable: practical applications of second-order algebraic theories and computation (MH), p. 28.
Onward-2017-Newcomb0JSS #automation #internet: I¿¿¿: a calculus for internet of things automation (JLN, SC0, JBJ, CS, MS), pp. 119–133.
POPL-2017-DudenhefnerR #bound: Intersection type calculi of bounded dimension (AD, JR), pp. 653–665.
POPL-2017-OmarVHAH #bidirectional #editing #named: Hazelnut: a bidirectionally typed structure editor calculus (CO, IV, MH, JA, MAH), pp. 86–99.
PPDP-2017-Ricciotti: A core calculus for provenance inspection (WR), pp. 187–198.
ESOP-2017-Miquey #dependent type: A Classical Sequent Calculus with Dependent Types (ÉM), pp. 777–803.
CSL-2017-CockettL #category theory: Integral Categories and Calculus Categories (JRBC, JSL), p. 17.
CSL-2017-GouveiaS: Aleph1 and the Modal mu-Calculus (MJG, LS), p. 16.
CSL-2017-KlinL: Modal mu-Calculus with Atoms (BK, ML), p. 21.
FM-2016-OdyFH: Discounted Duration Calculus (HO, MF, MRH), pp. 577–592.
FSCD-2016-Arisaka #interactive: Structural Interactions and Absorption of Structural Rules in BI Sequent Calculus (RA), p. 18.
ICFP-2016-AcarCRS #named #parallel: Dag-calculus: a calculus for parallel computation (UAA, AC, MR, FS), pp. 18–32.
ICFP-2016-DownenMAJ #compilation: Sequent calculus as a compiler intermediate language (PD, LM, ZMA, SPJ), pp. 74–88.
ICPR-2016-FoareLT16a #functional #image #segmentation #using: Image restoration and segmentation using the Ambrosio-Tortorelli functional and Discrete Calculus (MF, JOL, HT), pp. 1418–1423.
ECOOP-2016-ChenEW #programming: A Calculus for Variational Programming (SC, ME, EW), p. 28.
ECOOP-2016-OhoriUSK: A Calculus with Partially Dynamic Records for Typeful Manipulation of JSON Objects (AO, KU, TS, DK), p. 25.
POPL-2016-CurienFM #formal method #modelling: A theory of effects and resources: adjunction models and polarised calculi (PLC, MPF, GMM), pp. 44–56.
CASE-2016-KatoSHO #development #ide #modelling #multi: Integrated development environment for the multiple ambient calculus for modeling freight systems (TK, MS, MH, HO), pp. 367–372.
CSL-2016-BaeldeLS #finite #logic: A Sequent Calculus for a Modal Logic on Finite Data Trees (DB, SL, SS), p. 16.
CSL-2016-Ciabattoni #logic #theory and practice: Analytic Calculi for Non-Classical Logics: Theory and Applications (AC), p. 1.
IJCAR-2016-DawsonBG #logic #theorem #using: Machine-Checked Interpolation Theorems for Substructural Logics Using Display Calculi (JED, JB, RG), pp. 452–468.
IJCAR-2016-ZoharZ #automation #named #satisfiability: Gen2sat: An Automated Tool for Deciding Derivability in Analytic Pure Sequent Calculi (YZ, AZ), pp. 487–495.
ICALP-v1-2015-BeyersdorffCMS: Feasible Interpolation for QBF Resolution Calculi (OB, LC, MM, AS), pp. 180–192.
TLCA-2015-BucciarelliKR: Observability for Pair Pattern Calculi (AB, DK, SRDR), pp. 123–137.
TLCA-2015-Santo #exclamation: Curry-Howard for Sequent Calculus at Last! (JES), pp. 165–179.
ECOOP-2015-ShinnarSH #compilation: A Pattern Calculus for Rule Languages: Expressiveness, Compilation, and Mechanization (AS, JS, MH), pp. 542–567.
LOPSTR-2015-BodeiBGHL #analysis: A Global Occurrence Counting Analysis for Brane Calculi (CB, LB, RG, DH, FL), pp. 179–200.
POPL-2015-CraryS #memory management: A Calculus for Relaxed Memory (KC, MJS), pp. 623–636.
SAC-2015-AlrahmanNLTV #communication: A calculus for attribute-based communication (YAA, RDN, ML, FT, RV), pp. 1840–1845.
ESOP-2015-CastagnaI0B #pattern matching #xquery: A Core Calculus for XQuery 3.0 — Combining Navigational and Pattern Matching Approaches (GC, HI, KN, VB), pp. 232–256.
FoSSaCS-2015-CloustonG: Sequent Calculus in the Topos of Trees (RC, RG), pp. 133–147.
FoSSaCS-2015-GeblerLT #composition #metric #probability #process #reasoning: Compositional Metric Reasoning with Probabilistic Process Calculi (DG, KGL, ST), pp. 230–245.
CADE-2015-Platzer #difference #logic: A Uniform Substitution Calculus for Differential Dynamic Logic (AP), pp. 467–481.
LICS-2015-Edalat #difference: Extensions of Domain Maps in Differential and Integral Calculus (AE), pp. 426–437.
FM-2014-SchebenS #composition #performance #self: Efficient Self-composition for Weakest Precondition Calculi (CS, PHS), pp. 579–594.
FLOPS-2014-Sacchini #linear: Linear Sized Types in the Calculus of Constructions (JLS), pp. 169–185.
ICFP-2014-PetricekOM #named: Coeffects: a calculus of context-dependent computation (TP, DAO, AM), pp. 123–135.
ICEIS-v2-2014-ShumskyRW #execution #process: Processes Construction and π-calculus-based Execution and Tracing (LS, VR, VW), pp. 448–453.
ICPR-2014-VaradarajanV #geometry #representation #visual notation: 4D Space-Time Mereotopogeometry-Part Connectivity Calculus for Visual Object Representation (KMV, MV), pp. 4316–4321.
KR-2014-Bochman: Dynamic Causal Calculus (AB).
KR-2014-EwinPV #reasoning: Transforming Situation Calculus Action Theories for Optimised Reasoning (CJE, ARP, SV).
KR-2014-LakemeyerL #decidability #reasoning: Decidable Reasoning in a Fragment of the Epistemic Situation Calculus (GL, HJL).
KR-2014-MarrellaMS #adaptation #named #process: SmartPM: An Adaptive Process Management System through Situation Calculus, IndiGolog, and Classical Planning (AM, MM, SS).
POPL-2014-CousotC #abstract interpretation: A galois connection calculus for abstract interpretation (PC, RC), pp. 3–4.
SAC-2014-Umatani #implementation: Practical implementation techniques of ambient calculus in conventional dynamic languages (SU), pp. 1345–1351.
DATE-2014-BanerjeeD #constraints #generative #random #realtime #sequence: Acceptance and random generation of event sequences under real time calculus constraints (KB, PD), pp. 1–6.
ESOP-2014-BrunelGMZ: A Core Quantitative Coeffect Calculus (AB, MG, DM, SZ), pp. 351–370.
FoSSaCS-2014-Mio #similarity #μ-calculus: Upper-Expectation Bisimilarity and Łukasiewicz μ-Calculus (MM), pp. 335–350.
FoSSaCS-2014-MossakowskiT #specification: A Relatively Complete Calculus for Structured Heterogeneous Specifications (TM, AT), pp. 441–456.
ICLP-J-2014-BogaertsJBCVD #linear #simulation #using: Simulating Dynamic Systems Using Linear Time Calculus Theories (BB, JJ, MB, BdC, JV, MD), pp. 477–492.
IJCAR-2014-GoreOT #implementation #using: Implementing Tableau Calculi Using BDDs: BDDTab System Description (RG, KO, JT), pp. 337–343.
IJCAR-2014-LahavZ #satisfiability: SAT-Based Decision Procedure for Analytic Pure Sequent Calculi (OL, YZ), pp. 76–90.
IJCAR-2014-Lindblad #higher-order #logic: A Focused Sequent Calculus for Higher-Order Logic (FL), pp. 61–75.
IJCAR-2014-OlivettiP #implementation #logic #named: NESCOND: An Implementation of Nested Sequent Calculi for Conditional Logics (NO, GLP), pp. 511–518.
LICS-CSL-2014-BojanczykDK #composition #model checking #theorem #μ-calculus: Decomposition theorems and model-checking for the modal μ-calculus (MB, CD, SK), p. 10.
LICS-CSL-2014-ChaudhuriG #fixpoint #similarity: Equality and fixpoints in the calculus of structures (KC, NG), p. 10.
PODS-2013-Wong #power of #relational #set: A dichotomy in the intensional expressive power of nested relational calculi augmented with aggregate functions and a powerset operator (LW), pp. 285–296.
ICALP-v1-2013-FilmusLMNV #bound #comprehension #polynomial #towards: Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds — (YF, ML, MM, JN, MV), pp. 437–448.
LATA-2013-AotoI #rule-based #termination: Termination of Rule-Based Calculi for Uniform Semi-Unification (TA, MI), pp. 56–67.
IFM-2013-IshiiMN #automaton #hybrid #induction #verification: Inductive Verification of Hybrid Automata with Strongest Postcondition Calculus (DI, GM, SN), pp. 139–153.
RTA-2013-TushkanovaRGK #automation #decidability: Automatic Decidability: A Schematic Calculus for Theories with Counting Operators (ET, CR, AG, OK), pp. 303–318.
CAiSE-2013-BaryannisP #named #specification #web #web service: WSSL: A Fluent Calculus-Based Language for Web Service Specifications (GB, DP), pp. 256–271.
POPL-2013-Goyet: The λ λ-Bar calculus: a dual calculus for unconstrained strategies (AG), pp. 155–166.
PPDP-2013-AsadaHKHN #branch #finite #graph #graph transformation #monad: A parameterized graph transformation calculus for finite graphs with monadic branches (KA, SH, HK, ZH, KN), pp. 73–84.
SAC-2013-LaneseBF #approach #internet #process: Internet of things: a process calculus approach (IL, LB, MDF), pp. 1339–1346.
ESOP-2013-PetersNG #on the #process: On Distributability in Process Calculi (KP, UN, UG), pp. 310–329.
FASE-2013-BradfieldS #game studies #qvt #μ-calculus: Enforcing QVT-R with μ-Calculus and Games (JCB, PS), pp. 282–296.
STOC-2013-BeckNT #polynomial #trade-off: Some trade-off results for polynomial calculus: extended abstract (CB, JN, BT), pp. 813–822.
CSL-2013-AfshariL #on the #μ-calculus: On closure ordinals for the modal μ-calculus (BA, GEL), pp. 30–44.
CSL-2013-CloustonDGT #linear #logic: Annotation-Free Sequent Calculi for Full Intuitionistic Linear Logic (RC, JED, RG, AT), pp. 197–214.
CSL-2013-KrishnaswamiD #parametricity #relational: Internalizing Relational Parametricity in the Extensional Calculus of Constructions (NRK, DD), pp. 432–451.
LICS-2013-CristescuKV #composition #semantics: A Compositional Semantics for the Reversible p-Calculus (IC, JK, DV), pp. 388–397.
LICS-2013-FacchiniVZ #theorem #μ-calculus: A Characterization Theorem for the Alternation-Free Fragment of the Modal μ-Calculus (AF, YV, FZ), pp. 478–487.
LICS-2013-HirschkoffMS: Name-Passing Calculi: From Fusions to Preorders and Types (DH, JMM, DS), pp. 378–387.
LICS-2013-Sacchini #type system: Type-Based Productivity of Stream Definitions in the Calculus of Constructions (JLS), pp. 233–242.
VMCAI-2013-MouraJ #satisfiability: A Model-Constructing Satisfiability Calculus (LMdM, DJ), pp. 1–12.
RTA-2012-BonelliKLR #normalisation: Normalisation for Dynamic Pattern Calculi (EB, DK, CL, AR), pp. 117–132.
RTA-2012-Kirchner #logic: Rho-Calculi for Computation and Logic (CK), pp. 2–4.
SEFM-2012-ZhaoZZH: A Denotational Model for Instantaneous Signal Calculus (YZ, LZ, HZ, JH), pp. 126–140.
FLOPS-2012-AriolaDHNS #call-by #semantics: Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts (ZMA, PD, HH, KN, AS), pp. 32–46.
KR-2012-GiacomoLP #bound #decidability #verification: Bounded Situation Calculus Action Theories and Decidable Verification (GDG, YL, FP).
TOOLS-EUROPE-J-2011-IngesmanE12 #java #morphism #polymorphism: Lifted Java: A Minimal Calculus for Translation Polymorphism (MDI, EE), pp. 1–23.
PLDI-2012-OliveiraSCLY #programming: The implicit calculus: a new foundation for generic programming (BCdSO, TS, WC, WL, KY), pp. 35–44.
SAS-2012-CalvertM #analysis #control flow: Control Flow Analysis for the Join Calculus (PC, AM), pp. 181–197.
GPCE-2012-WalkingshawE #implementation #modelling: A calculus for modeling and implementing variation (EW, ME), pp. 132–140.
FASE-2012-BradfieldS #qvt #recursion #μ-calculus: Recursive Checkonly QVT-R Transformations with General when and where Clauses via the Modal μ Calculus (JCB, PS), pp. 194–208.
CSL-2012-ChaudhuriHM #approach: A Systematic Approach to Canonicity in the Classical Sequent Calculus (KC, SH, DM), pp. 183–197.
IJCAR-2012-BaazLZ #effectiveness #semantics: Effective Finite-Valued Semantics for Labelled Calculi (MB, OL, AZ), pp. 52–66.
IJCAR-2012-EchenimP #generative: A Calculus for Generating Ground Explanations (ME, NP), pp. 194–209.
LICS-2012-AvronKZ #composition #logic: Modular Construction of Cut-free Sequent Calculi for Paraconsistent Logics (AA, BK, AZ), pp. 85–94.
LICS-2012-GargGN #logic #multi: Countermodels from Sequent Calculi in Multi-Modal Logics (DG, VG, SN), pp. 315–324.
LICS-2012-PierardS #distributed #higher-order: A Higher-Order Distributed Calculus with Name Creation (AP, ES), pp. 531–540.
DocEng-2011-Vion-Dury #editing #xml: A generic calculus of XML editing deltas (JYVD), pp. 113–120.
ICALP-v2-2011-FischerK #hybrid #linear #model checking #μ-calculus: Model Checking the Quantitative μ-Calculus on Linear Hybrid Systems (DF, LK), pp. 404–415.
IFM-J-2009-Weiss11 #abstraction #logic: Predicate abstraction in a program logic calculus (BW), pp. 861–876.
SEFM-2011-BorgstromHJRVPP #protocol: Broadcast Psi-calculi with an Application to Wireless Protocols (JB, SH, MJ, PR, BV, JÅP, JP), pp. 74–89.
CEFP-2011-MichaelsonG #multi #reasoning: Reasoning about Multi-process Systems with the Box Calculus (GM, GG), pp. 279–338.
CIKM-2011-VirgilioM #data analysis #using: RFID data analysis using tensor calculus for supply chain management (RDV, FM), pp. 1743–1748.
SEKE-2011-GregoriadesLP11a #risk management #using: Project Risk Management Using Event Calculus(S) (AG, VPL, PP), pp. 335–338.
TOOLS-EUROPE-2011-IngesmanE #java #morphism #polymorphism: Lifted Java: A Minimal Calculus for Translation Polymorphism (MDI, EE), pp. 179–193.
PLDI-2011-PerezR #logic #proving #theorem proving: Separation logic + superposition calculus = heap theorem prover (JANP, AR), pp. 556–566.
ASE-2011-Hall #tool support: The Capture Calculus Toolset (RJH), pp. 628–632.
GTTSE-2011-ErwigW #programming: Variation Programming with the Choice Calculus (ME, EW), pp. 55–100.
FoSSaCS-2011-Mio #independence #probability #μ-calculus: Probabilistic Modal μ-Calculus with Independent Product (MM), pp. 290–304.
FoSSaCS-2011-PierardS #bisimulation #distributed #higher-order #process: Sound Bisimulations for Higher-Order Distributed Process Calculus (AP, ES), pp. 123–137.
CAV-2011-ChinGVLCQ #verification: A Specialization Calculus for Pruning Disjunctive Predicates to Support Verification (WNC, CG, RV, QLL, FC, SQ), pp. 293–309.
CSL-2011-BucciarelliCEM #abstraction #testing: Full Abstraction for Resource Calculus with Tests (AB, AC, TE, GM), pp. 97–111.
CSL-2011-ChaudhuriGS: The Focused Calculus of Structures (KC, NG, LS), pp. 159–173.
DocEng-2010-Vion-Dury #difference #documentation #editing #towards #xml: Diffing, patching and merging XML documents: toward a generic calculus of editing deltas (JYVD), pp. 191–194.
ICALP-v2-2010-LanesePSS #communication #higher-order #on the #process: On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi (IL, JAP, DS, AS), pp. 442–453.
LATA-2010-Lin #complexity: Modal Nonassociative Lambek Calculus with Assumptions: Complexity and Context-Freeness (ZL0), pp. 414–425.
RTA-2010-GuglielmiGP #proving: A Proof Calculus Which Reduces Syntactic Bureaucracy (AG, TG, MP), pp. 135–150.
SEFM-2010-GallardoS #verification #μ-calculus: Verification of Dynamic Data Tree with μ-calculus Extended with Separation (MdMG, DS), pp. 211–221.
FLOPS-2010-Abel #evaluation #normalisation #towards: Towards Normalization by Evaluation for the βη-Calculus of Constructions (AA), pp. 224–239.
ICFP-2010-ReedP #difference #distance #privacy: Distance makes the types grow stronger: a calculus for differential privacy (JR, BCP), pp. 157–168.
ICGT-2010-GadducciLV #higher-order #semantics #μ-calculus: Counterpart Semantics for a Second-Order μ-Calculus (FG, ALL, AV), pp. 282–297.
ICGT-2010-Monreale #automaton #encoding #lts #process #semantics #visual notation: LTS Semantics for Process Calculi from Their Graphical Encodings (GVM), pp. 403–406.
ICGT-2010-PoskittP #graph #hoare #source code: A Hoare Calculus for Graph Programs (CMP, DP), pp. 139–154.
KR-2010-BaumannBSTZ: State Defaults and Ramifications in the Unifying Action Calculus (RB, GB, HS, MT, VZ).
KR-2010-GiacomoLP #game studies #reasoning #representation #source code: Situation Calculus Based Programs for Representing and Reasoning about Game Structures (GDG, YL, ARP).
KR-2010-Thielscher: Integrating Action Calculi and AgentSpeak: Closing the Gap (MT).
ECOOP-2010-FraineES #aspect-oriented: Essential AOP: The A Calculus (BDF, EE, MS), pp. 101–125.
QAPL-2010-AltisenLM #automaton #component #evaluation #interface #performance #realtime #using: Performance Evaluation of Components Using a Granularity-based Interface Between Real-Time Calculus and Timed Automata (KA, YL, MM), pp. 16–33.
QAPL-2010-CoppoDDGT #probability: Stochastic Calculus of Wrapped Compartments (MC, FD, MD, EG, AT), pp. 82–98.
SAC-2010-ChokshiB #analysis #performance #realtime #revisited #using: Performance analysis of FlexRay-based systems using real-time calculus, revisited (DBC, PB), pp. 351–356.
PPoPP-2010-LeeP #parallel: Featherweight X10: a core calculus for async-finish parallelism (JKL, JP), pp. 25–36.
ESOP-2010-SouleHGGAKW: A Universal Calculus for Stream Processing Languages (RS, MH, RG, BG, HA, VK, KLW), pp. 507–528.
FoSSaCS-2010-CateF #finite #proving #μ-calculus: An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees (BtC, GF), pp. 161–175.
FoSSaCS-2010-EggerMS #continuation: Linearly-Used Continuations in the Enriched Effect Calculus (JE, REM, AS), pp. 18–32.
TACAS-2010-MoyA #problem #realtime: Arrival Curves for Real-Time Calculus: The Causality Problem and Its Solutions (MM, KA), pp. 358–372.
CSL-2010-AlendaOST: Tableau Calculi for CSL over minspaces (RA, NO, CS, DT), pp. 52–66.
CSL-2010-Hetzl #representation: A Sequent Calculus with Implicit Term Representation (SH), pp. 351–365.
CSL-2010-KuncakPS #data type #order #set: Ordered Sets in the Calculus of Data Structures (VK, RP, PS), pp. 34–48.
ICLP-2010-Guenot10 #linear #logic #proving: Focused Proof Search for Linear Logic in the Calculus of Structures (NG), pp. 84–93.
IJCAR-2010-AbourbihBBM #automation: A Single-Significant-Digit Calculus for Semi-Automated Guesstimation (JAA, LB, AB, FM), pp. 354–368.
IJCAR-2010-BrilloutKRW #quantifier: An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic (AB, DK, PR, TW), pp. 384–399.
LICS-2010-BartolettiZ #process: A Calculus of Contracting Processes (MB, RZ), pp. 332–341.
LICS-2010-JohanssonBPV: Weak Equivalences in Psi-Calculi (MJ, JB, JP, BV), pp. 322–331.
LICS-2010-Milius #finite: A Sound and Complete Calculus for Finite Stream Circuits (SM), pp. 421–430.
VMCAI-2010-KuncakPSW #data type: Building a Calculus of Data Structures (VK, RP, PS, TW), pp. 26–44.
CBSE-2009-LauO #component #composition #encapsulation: Control Encapsulation: A Calculus for Exogenous Composition of Software Components (KKL, MO), pp. 121–139.
DLT-2009-Meinecke #word #μ-calculus: A Weighted μ-Calculus on Words (IM), pp. 384–395.
ICALP-v2-2009-KobayashiO #complexity #model checking #recursion #μ-calculus: Complexity of Model Checking Recursion Schemes for Fragments of the Modal μ-Calculus (NK, CHLO), pp. 223–234.
ICALP-v2-2009-NicolaLLM #probability #process: Rate-Based Transition Systems for Stochastic Process Calculi (RDN, DL, ML, MM), pp. 435–446.
IFM-2009-Weiss #abstraction #logic: Predicate Abstraction in a Program Logic Calculus (BW), pp. 136–150.
RTA-2009-KimuraT #induction: Dual Calculus with Inductive and Coinductive Types (DK, MT), pp. 224–238.
SFM-2009-Bruni: Calculi for Service-Oriented Computing (RB), pp. 1–41.
ECOOP-2009-LagorioSZ #composition: Featherweight Jigsaw: A Minimal Core Calculus for Modular Composition of Classes (GL, MS, EZ), pp. 244–268.
PEPM-2009-DavidGC #exception #optimisation: Translation and optimization for a core calculus with exceptions (CD, CG, WNC), pp. 41–50.
PLDI-2009-TorreMP #fixpoint #recursion #source code #using: Analyzing recursive programs using a fixed-point calculus (SLT, PM, GP), pp. 211–222.
POPL-2009-ElmasQT: A calculus of atomic actions (TE, SQ, ST), pp. 2–15.
PPDP-2009-CooperW: The RPC calculus (EC, PW), pp. 231–242.
QAPL-2009-BortolussiV #named: CoBiC: Context-dependent Bioambient Calculus (LB, MGV), pp. 187–201.
WRLA-2008-AndreiL09 #proving: Strategy-Based Proof Calculus for Membrane Systems (OA, DL), pp. 23–43.
WRLA-2008-HolenJW09 #first-order #maude #proving: Proof Search for the First-Order Connection Calculus in Maude (BH, EBJ, AW), pp. 173–188.
FoSSaCS-2009-FossatiV: The Calculus of Handshake Configurations (LF, DV), pp. 227–241.
FoSSaCS-2009-LengletSS #bisimulation: Normal Bisimulations in Calculi with Passivation (SL, AS, JBS), pp. 257–271.
CADE-2009-NguyenS #logic: A Tableau Calculus for Regular Grammar Logics with Converse (LAN, AS), pp. 421–436.
CADE-2009-ZhangHD: A Refined Resolution Calculus for CTL (LZ, UH, CD), pp. 245–260.
CSL-2009-CirsteaKP #algebra #μ-calculus: EXPTIME Tableaux for the Coalgebraic μ-Calculus (CC, CK, DP), pp. 179–193.
CSL-2009-EggerMS #linear: Enriching an Effect Calculus with Linear Types (JE, REM, AS), pp. 240–254.
CSL-2009-Tatsuta #commutative #first-order: Non-Commutative First-Order Sequent Calculus (MT), pp. 470–484.
LICS-2009-BengtsonJPV #logic #mobile #named #process: Psi-calculi: Mobile Processes, Nominal Data, and Logic (JB, MJ, JP, BV), pp. 39–48.
LICS-2009-Dominguez #logic #polymorphism #similarity: Fully Abstract Logical Bisimilarity for a Polymorphic Object Calculus (LD), pp. 81–90.
LICS-2009-KobayashiO #higher-order #model checking #recursion #type system #μ-calculus: A Type System Equivalent to the Modal μ-Calculus Model Checking of Higher-Order Recursion Schemes (NK, CHLO), pp. 179–188.
LICS-2009-LiangM #proving: A Unified Sequent Calculus for Focused Proofs (CL, DM), pp. 355–364.
ICALP-B-2008-NeubauerT: Placement Inference for a Client-Server Calculus (MN, PT), pp. 75–86.
SEFM-2008-FranzleH #approximate #model checking #performance: Efficient Model Checking for Duration Calculus Based on Branching-Time Approximations (MF, MRH), pp. 63–72.
SEFM-2008-OliveiraGC #named #refinement: CRefine: Support for the Circus Refinement Calculus (MO, ACG, CGdC), pp. 281–290.
SFM-2008-BarbutiCMMP #sequence: The Calculus of Looping Sequences (RB, GC, AMS, PM, GP), pp. 387–423.
SFM-2008-VersariG #implementation #process: pi@: A pi-Based Process Calculus for the Implementation of Compartmentalised Bio-inspired Calculi (CV, RG), pp. 449–506.
ICFP-2008-ChargueraudP #functional: Functional translation of a calculus of capabilities (AC, FP), pp. 213–224.
KR-2008-KellyP: Complex Epistemic Modalities in the Situation Calculus (RFK, ARP), pp. 611–620.
KR-2008-Petrick #composition: Cartesian Situations and Knowledge Decomposition in the Situation Calculus (RPAP), pp. 629–639.
KR-2008-RenzL #automation #complexity #proving: Automated Complexity Proofs for Qualitative Spatial and Temporal Calculi (JR, JJL), pp. 715–723.
ICSE-2008-ChenDS #verification: A verification system for timed interval calculus (CC, JSD, JS), pp. 271–280.
SAC-2008-Willassen #using: Using simplified event calculus in digital investigation (SYW), pp. 1438–1442.
GPCE-2008-ApelKL #feature model #java #programming #refinement: Feature featherweight java: a calculus for feature-oriented programming and stepwise refinement (SA, CK, CL), pp. 101–112.
ESOP-2008-VieiraCS: The Conversation Calculus: A Model of Service-Oriented Computation (HTV, LC, JCS), pp. 269–283.
FoSSaCS-2008-BarrasB #dependent type #programming language: The Implicit Calculus of Constructions as a Programming Language with Dependent Types (BB, BB), pp. 365–379.
FoSSaCS-2008-KlinS #probability #process #semantics: Structural Operational Semantics for Stochastic Process Calculi (BK, VS), pp. 428–442.
CSL-2008-Berardid: A Calculus of Realizers for EM1 Arithmetic (SB, Ud), pp. 215–229.
CSL-2008-ColcombetL #problem #μ-calculus: The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem (TC, CL), pp. 416–430.
CSL-2008-Fontaine #μ-calculus: Continuous Fragment of the μ-Calculus (GF), pp. 139–153.
IJCAR-2008-HofnerS #automation #on the: On Automating the Calculus of Relations (PH, GS), pp. 50–66.
LICS-2008-Beffara #algebra #process: An Algebraic Process Calculus (EB), pp. 130–141.
LICS-2008-LanesePSS #decidability #higher-order #on the #process: On the Expressiveness and Decidability of Higher-Order Process Calculi (IL, JAP, DS, AS), pp. 145–155.
LICS-2008-Riis #complexity #on the #polynomial #proving: On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity (SR), pp. 272–283.
ICALP-2007-KobayashiS #behaviour #type system: Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the π -Calculus (NK, TS), pp. 740–751.
RTA-2007-CirsteaF #confluence: Confluence of Pattern-Based Calculi (HC, GF), pp. 78–92.
RTA-2007-Kikuchi #normalisation #proving: Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi (KK), pp. 257–272.
RTA-2007-Schmidt-Schauss #correctness: Correctness of Copy in Calculi with Letrec (MSS), pp. 329–343.
TLCA-2007-Boulme #refinement: Intuitionistic Refinement Calculus (SB), pp. 54–69.
TLCA-2007-CousineauD #type system: Embedding Pure Type Systems in the λ-π-Calculus Modulo (DC, GD), pp. 102–117.
TLCA-2007-DavidN #equation #normalisation #proving #recursion: An Arithmetical Proof of the Strong Normalization for the λ -Calculus with Recursive Equations on Types (RD, KN), pp. 84–101.
TLCA-2007-IntrigilaS: The ω-Rule is Π¹₁-Complete in the λβ-Calculus (BI, RS), pp. 178–193.
TLCA-2007-SantoMP #continuation #normalisation: Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi (JES, RM, LP), pp. 133–147.
WRLA-J-2004-CirsteaFK07 #constraints: A rho-calculus of explicit constraint application (HC, GF, CK), pp. 37–72.
WRLA-2006-CirsteaHW07: Distributive rho-calculus (HC, CH, BW), pp. 95–111.
ESOP-2007-AcciaiBD #concurrent #transaction: A Concurrent Calculus with Atomic Transactions (LA, MB, SDZ), pp. 48–63.
ESOP-2007-LapadulaPT #distributed #web #web service: A Calculus for Orchestration of Web Services (AL, RP, FT), pp. 33–47.
ESOP-2007-SuenagaK #analysis #concurrent #type system: Type-Based Analysis of Deadlock for a Concurrent Calculus with Interrupts (KS, NK), pp. 490–504.
ESOP-2007-Versari #analysis #comparative: A Core Calculus for a Comparative Analysis of Bio-inspired Calculi (CV), pp. 411–425.
FoSSaCS-2007-BertolissiK #combinator #reduction: The Rewriting Calculus as a Combinatory Reduction System (CB, CK), pp. 78–92.
FoSSaCS-2007-FerranteM #μ-calculus: Enriched μ-Calculi Module Checking (AF, AM), pp. 183–197.
CSL-2007-BlanquiJS #induction: Building Decision Procedures in the Calculus of Inductive Constructions (FB, JPJ, PYS), pp. 328–342.
CSL-2007-GaboardiR: A Soft Type Assignment System for λ -Calculus (MG, SRDR), pp. 253–267.
CSL-2007-GaintzarainHLNO #invariant: A Cut-Free and Invariant-Free Sequent Calculus for PLTL (JG, MH, PL, MN, FO), pp. 481–495.
CSL-2007-Kesner #formal method #revisited: The Theory of Calculi with Explicit Substitutions Revisited (DK), pp. 238–252.
CSL-2007-KorovinV #linear: Integrating Linear Arithmetic into Superposition Calculus (KK, AV), pp. 223–237.
CSL-2007-Miquel: Classical Program Extraction in the Calculus of Constructions (AM), pp. 313–327.
LICS-2007-BrotherstonS #induction #infinity: Complete Sequent Calculi for Induction and Infinite Descent (JB, AS), pp. 51–62.
LICS-2007-JurdzinskiL #μ-calculus: Alternation-free modal μ-calculus for data trees (MJ, RL), pp. 131–140.
TAP-2007-RummerS #java #logic #proving #source code #using: Proving Programs Incorrect Using a Sequent Calculus for Java Dynamic Logic (PR, MAS), pp. 41–60.
ICALP-v1-2006-KojevnikovI #bound #proving: Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies (AK, DI), pp. 323–334.
ICALP-v2-2006-BonattiLMV #complexity #μ-calculus: The Complexity of Enriched μ-Calculi (PAB, CL, AM, MYV), pp. 540–551.
ICALP-v2-2006-Boreale #information management #process: Quantifying Information Leakage in Process Calculi (MB), pp. 119–131.
ICFP-2006-Abadi #data access #dependence: Access control in a core calculus of dependency (MA), pp. 263–273.
ICPR-v1-2006-LamY #algorithm #clustering: Improved Clustering Algorithm Based on Calculus of Variation (BSYL, HY), pp. 900–903.
KR-2006-SannerM #first-order #hybrid #logic #reasoning: An Ordered Theory Resolution Calculus for Hybrid Reasoning in First-Order Extensions of Description Logic (SS, SAM), pp. 100–111.
KR-2006-ThielscherW #semantics: The Features-and-Fluents Semantics for the Fluent Calculus (MT, TW), pp. 362–370.
QAPL-2005-McIverM06 #game studies #novel #probability #μ-calculus: A Novel Stochastic Game Via the Quantitative μ-calculus (AM, CM), pp. 195–212.
POPL-2006-AlurCM #fixpoint: A fixpoint calculus for local and global program flows (RA, SC, PM), pp. 153–165.
POPL-2006-ErnstOC: A virtual class calculus (EE, KO, WRC), pp. 270–282.
PPDP-2006-FernandezF #functional #object-oriented: A historic functional and object-oriented calculus (MF, FF), pp. 145–156.
QAPL-2006-VigliottiH #probability: Stochastic Ambient Calculus (MGV, PGH), pp. 169–186.
PDP-2006-GhafoorYDM #exception #protocol: p_RBT-calculus Compensation and Exception Handling Protocol (AGM, JY, JD, MMuR), pp. 39–47.
PDP-2006-GhafoorYDM06a #collaboration #network: Operability of p-calculus Technology in P2P Collaboration Business Network (AGM, JY, JD, MMuR), pp. 239–247.
ESOP-2006-BrobergS #policy #towards: Flow Locks: Towards a Core Calculus for Dynamic Flow Policies (NB, DS), pp. 180–196.
ESOP-2006-JayK: Pure Pattern Calculus (CBJ, DK), pp. 100–114.
ESOP-2006-SummersB #morphism #polymorphism: Approaches to Polymorphism in Classical Sequent Calculus (AJS, SvB), pp. 84–99.
FASE-2006-KobW #debugging #using: Fundamentals of Debugging Using a Resolution Calculus (DK, FW), pp. 278–292.
FoSSaCS-2006-PhillipsU #algebra #process: Reversing Algebraic Process Calculi (ICCP, IU), pp. 246–260.
FoSSaCS-2006-Rohde #on the #μ-calculus: On the μ-Calculus Augmented with Sabotage (PR), pp. 142–156.
CSL-2006-LengrandDM #type system: A Sequent Calculus for Type Theory (SL, RD, JM), pp. 441–455.
CSL-2006-ScheweF #finite #satisfiability #μ-calculus: Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus (SS, BF), pp. 591–605.
FATES-RV-2006-FalconeFMR #framework #network #policy #security: A Test Calculus Framework Applied to Network Security Policies (YF, JCF, LM, JLR), pp. 55–69.
ICLP-2006-GebserS #programming #set: Tableau Calculi for Answer Set Programming (MG, TS), pp. 11–25.
IJCAR-2006-DyckhoffKL #bound #logic: Strong Cut-Elimination Systems for Hudelmaier’s Depth-Bounded Sequent Calculus for Implicational Logic (RD, DK, SL), pp. 347–361.
IJCAR-2006-Walukiewicz-ChrzaszczC #consistency: Consistency and Completeness of Rewriting in the Calculus of Constructions (DWC, JC), pp. 619–631.
IJCAR-2006-ZamanskyA #canonical #quantifier: Canonical Gentzen-Type Calculi with (n, k)-ary Quantifiers (AZ, AA), pp. 251–265.
LICS-2006-FioreS #congruence #process #semantics: A Congruence Rule Format for Name-Passing Process Calculi from Mathematical Structural Operational Semantics (MPF, SS), pp. 49–58.
SAT-2006-BonetLM #satisfiability: A Complete Calculus for Max-SAT (MLB, JL, FM), pp. 240–251.
WICSA-2005-AliPRC #aspect-oriented #mobile: Introducing Ambient Calculus in Mobile Aspect-Oriented Software (NA, JP, IR, JÁC), pp. 233–234.
ICALP-2005-NicolaGP: Basic Observables for a Calculus for Global Computing (RDN, DG, RP), pp. 1226–1238.
FM-2005-Bosnacki #abstraction #on the #μ-calculus: On Some Galois Connection Based Abstractions for the μ-Calculus (DB), pp. 366–381.
SEFM-2005-AnantharamanCH #process: A Synchronous Process Calculus for Service Costs (SA, JC, GH), pp. 435–444.
TLCA-2005-Hermant #semantics: Semantic Cut Elimination in the Intuitionistic Sequent Calculus (OH), pp. 221–233.
TLCA-2005-SchurmannPS #encoding #functional #higher-order #programming: The [triangle]-Calculus. Functional Programming with Higher-Order Encodings (CS, AP, JS), pp. 339–353.
SEKE-2005-IzadiM #algorithm #model checking #performance #μ-calculus: An Efficient Model Checking Algorithm for a Fragment of μ-Calculus (MI, AMR), pp. 392–395.
QAPL-2004-Lluch-LafuenteM05 #constraints: Quantitative ?-calculus and CTL Based on Constraint Semirings (ALL, UM), pp. 37–59.
PPDP-2005-Gabbay: A new calculus of contexts (MG), pp. 94–105.
SAS-2005-Gordon #process #security: From Typed Process Calculi to Source-Based Security (ADG), p. 2.
ESEC-FSE-2005-Barbosa #architecture #component #refinement: A refinement calculus for software components and architectures (MAB), pp. 377–380.
SAC-2005-Guillen-ScholtenABB #coordination #mobile: MoCha-pi, an exogenous coordination calculus based on mobile channels (JGS, FA, FSdB, MMB), pp. 436–442.
WRLA-2004-CirsteaFK05 #constraints: A rho-Calculus of Explicit Constraint Application (HC, GF, CK), pp. 51–67.
WRLA-2004-LiquoriW05 #polymorphism #type checking #type inference: The Polymorphic Rewriting-calculus: [Type Checking vs. Type Inference] (LL, BW), pp. 89–111.
WRLA-2004-Wang05 #maude #model checking #μ-calculus: μ-Calculus Model Checking in Maude (BYW), pp. 135–152.
ESOP-2005-MakholmW #mobile #polymorphism #process #reduction #type system: Instant Polymorphic Type Systems for Mobile Process Calculi: Just Add Reduction Rules and Close (HM, JBW), pp. 389–407.
FoSSaCS-2005-EdalatLP #difference #multi: A Computational Model for Multi-variable Differential Calculus (AE, AL, DP), pp. 505–519.
FoSSaCS-2005-FerrariMT #model checking: Model Checking for Nominal Calculi (GLF, UM, ET), pp. 1–24.
FoSSaCS-2005-FocardiRS #process #security: Bridging Language-Based and Process Calculi Security (RF, SR, AS), pp. 299–315.
CADE-2005-Autexier: The CoRe Calculus (SA), pp. 84–98.
CADE-2005-BaumgartnerT #evolution #similarity: The Model Evolution Calculus with Equality (PB, CT), pp. 392–408.
CSL-2005-BarrasG #induction #on the: On the Role of Type Decorations in the Calculus of Inductive Constructions (BB, BG), pp. 151–166.
CSL-2005-Blanqui #algebra #decidability: Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations (FB), pp. 135–150.
CSL-2005-BradfieldDQ #μ-calculus: Transfinite Extension of the μ-Calculus (JCB, JD, SQ), pp. 384–396.
LICS-2005-CastagnaNV #semantics #type system: Semantic Subtyping for the p-Calculus (GC, RDN, DV), pp. 92–101.
VMCAI-2005-GrumbergLLS: Don’t Know in the µ-Calculus (OG, ML, ML, SS), pp. 233–249.
VMCAI-2005-Lange #automaton #linear: Weak Automata for the Linear Time µ-Calculus (ML), pp. 267–281.
ICALP-2004-BusiGZ #process #recursion #replication: Comparing Recursion, Replication, and Iteration in Process Calculi (NB, MG, GZ), pp. 307–319.
ICALP-2004-Laird: A Calculus of Coroutines (JL), pp. 882–893.
ICALP-2004-Soltys #permutation: LA, Permutations, and the Hajós Calculus (MS), pp. 1176–1187.
RTA-2004-JonesB #analysis #termination: Termination Analysis of the Untyped lamba-Calculus (NDJ, NB), pp. 1–23.
FLOPS-2004-Kahl #pattern matching: Basic Pattern Matching Calculi: a Fresh View on Matching Failure (WK), pp. 276–290.
FLOPS-2004-Kikuchi #normalisation #proving: A Direct Proof of Strong Normalization for an Extended Herbelin?s Calculus (KK), pp. 244–259.
KR-2004-CondottaL #axiom: Axiomatizing the Cyclic Interval Calculus (JFC, GL), pp. 95–105.
KR-2004-DeneckerT #induction: Inductive Situation Calculus (MD, ET), pp. 545–553.
KR-2004-MartinNT: Knowledge of Other Agents and Communicative Actions in the Fluent Calculus (YM, IN, MT), pp. 623–633.
PPDP-2004-LiquoriS #imperative #named: iRho: an imperative rewriting calculus (LL, BPS), pp. 167–178.
PPDP-2004-Lopez-FraguasRV #constraints #declarative #lazy evaluation #programming: A lazy narrowing calculus for declarative constraint programming (FJLF, MRA, RdVV), pp. 43–54.
ASE-2004-SpanoudakisM #framework #monitoring #requirements #towards: Requirements Monitoring for Service-Based Systems: Towards a framework based on Event Calculus (GS, KM), pp. 379–384.
SAC-2004-BettiniBL #higher-order #mixin: A core calculus of higher-order mixins and classes (LB, VB, SL), pp. 1508–1509.
SAC-2004-FagorziZA #modelling #multi: Modeling multiple class loaders by a calculus for dynamic linking (SF, EZ, DA), pp. 1281–1288.
GPCE-2004-AnconaM: A Fresh Calculus for Name Management (DA, EM), pp. 206–224.
ESOP-2004-LhoussaineS: A Dependently Typed Ambient Calculus (CL, VS), pp. 171–187.
ESOP-2004-PhillipsYE #automaton #distributed: A Distributed Abstract Machine for Boxed Ambient Calculi (AP, NY, SE), pp. 155–170.
FoSSaCS-2004-GiambiagiSV #behaviour #infinity #on the #process: On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi (PG, GS, FDV), pp. 226–240.
FoSSaCS-2004-PhillipsV: Electoral Systems in Ambient Calculi (IP, MGV), pp. 408–422.
FoSSaCS-2004-Polonovski #normalisation #μ-calculus: Strong Normalization of λμμ-Calculus with Explicit Substitutions (EP), pp. 423–437.
FoSSaCS-2004-WischikG #bisimulation: Strong Bisimulation for the Explicit Fusion Calculus (LW, PG), pp. 484–498.
FoSSaCS-2004-ZuninoD #encryption #process: A Note on the Perfect Encryption Assumption in a Process Calculus (RZ, PD), pp. 514–528.
CSL-2004-AvelloneFFM #implementation #logic #performance: A Space Efficient Implementation of a Tableau Calculus for a Logic with a Constructive Negation (AA, CF, GF, UM), pp. 488–502.
CSL-2004-Ciabattoni #automation #generative #logic: Automated Generation of Analytic Calculi for Logics with Linearity (AC), pp. 503–517.
CSL-2004-Hyland #abstract interpretation #proving: Abstract Interpretation of Proofs: Classical Propositional Calculus (MH), pp. 6–21.
ICLP-2004-KundajiS #development #refinement #semantics: Development of Semantic Debuggers Based on Refinement Calculus (RNK, RKS), pp. 460–461.
IJCAR-2004-Farmer #formal method: Formalizing Undefinedness Arising in Calculus (WMF), pp. 475–489.
LICS-2004-AbramskyGMOS #abstraction #game studies: Nominal Games and Full Abstraction for the Nu-Calculus (SA, DRG, ASM, CHLO, IDBS), pp. 150–159.
LICS-2004-GabbayC #logic: A Sequent Calculus for Nominal Logic (MG, JC), pp. 139–148.
LICS-2004-IntrigilaS: The ω-Rule is Π⁰₂-Hard in the λβ-Calculus (BI, RS), pp. 202–210.
ICALP-2003-BusiGZ #recursion #replication: Replication vs. Recursive Definitions in Channel Based Calculi (NB, MG, GZ), pp. 133–144.
ICALP-2003-GutierrezR #type system: Expansion Postponement via Cut Elimination in Sequent Calculi for Pure Type Systems (FG, BCR), pp. 956–968.
TLCA-2003-Blanqui #algebra #induction: Inductive Types in the Calculus of Algebraic Constructions (FB), pp. 46–59.
TLCA-2003-SantoP #multi: Permutative Conversions in Intuitionistic Multiary Sequent Calculi with Cuts (JES, LP), pp. 286–300.
ECOOP-2003-JagadeesanJR #aspect-oriented #source code: A Calculus of Untyped Aspect-Oriented Programs (RJ, AJ, JR), pp. 54–73.
POPL-2003-Chen #type system: Coercive subtyping for the calculus of constructions (GC), pp. 150–159.
POPL-2003-SchmittS #distributed #higher-order #process: The m-calculus: a higher-order distributed process calculus (AS, JBS), pp. 50–61.
PPDP-2003-Virseda: A demand-driven narrowing calculus with overlapping definitional trees (RdVV), pp. 253–263.
ASE-2003-Wile #architecture #non-functional: Architecture Style-Based Calculi for Non-functional Properties (DSW), pp. 299–303.
FoSSaCS-2003-ArnoldS #ambiguity #game studies #μ-calculus: Ambiguous Classes in the Games μ-Calculus Hierarchy (AA, LS), pp. 70–86.
FoSSaCS-2003-Bonelli #higher-order #normalisation: A Normalisation Result for Higher-Order Calculi with Explicit Substitutions (EB), pp. 153–168.
FoSSaCS-2003-SprengerD #induction #on the #proving #reasoning #μ-calculus: On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the μ-Calculus (CS, MD), pp. 425–440.
TACAS-2003-HenzingerKM #on the #μ-calculus: On the Universal and Existential Fragments of the μ-Calculus (TAH, OK, RM), pp. 49–64.
CADE-2003-BaumgartnerT #evolution: The Model Evolution Calculus (PB, CT), pp. 350–364.
CAV-2003-Obdrzalek #bound #model checking #performance #μ-calculus: Fast μ-Calculus Model Checking when Tree-Width Is Bounded (JO), pp. 80–92.
CSL-2003-MaksimovaV #complexity #problem: Complexity of Some Problems in Modal and Intuitionistic Calculi (LM, AV), pp. 397–412.
CSL-2003-MoserZ: The Epsilon Calculus (GM, RZ), p. 455.
CSL-2003-SatoSKI: Calculi of Meta-variables (MS, TS, YK, AI), pp. 484–497.
CSL-2003-Schroder #modelling: Henkin Models of the Partial σ-Calculus (LS), pp. 498–512.
FME-2002-Basin #synthesis: The Next 700 Synthesis Calculi (DAB), p. 430.
RTA-2002-FaureK #exception: Exceptions in the Rewriting Calculus (GF, CK), pp. 66–82.
RTA-2002-Forest #pattern matching: A Weak Calculus with Explicit Operators for Pattern Matching and Substitution (JF), pp. 174–191.
RTA-2002-Struth: Deriving Focused Lattice Calculi (GS), pp. 83–97.
FLOPS-2002-BarbosaO #induction #process: Coinductive Interpreters for Process Calculi (LSB, JNO), pp. 183–197.
FLOPS-2002-SumiiB #functional #named: VMλ: A Functional Calculus for Scientific Discovery (ES, HB), pp. 290–304.
ICFP-2002-OhoriY: An interoperable calculus for external object access (AO, KY), pp. 60–71.
KR-2002-Amir: Projection in Decomposed Situation Calculus (EA), pp. 315–326.
KR-2002-MateusPP #probability: Observations and the Probabilistic Situation Calculus (PM, AP, JP), pp. 327–340.
KR-2002-McCarthy: Actions and Other Events in Situation Calculus (JM0), pp. 615–628.
OOPSLA-2002-Pucella #formal method #towards: Towards a formalization for COM part i: the primitive calculus (RP), pp. 331–342.
LOPSTR-2002-FernandezS #approach: An Operational Approach to Program Extraction in the Calculus of Constructions (MF, PS), pp. 111–125.
LOPSTR-2002-GutierrezR #type system #verification: A Cut-Free Sequent Calculus for Pure Type Systems Verifying the Structural Rules of Gentzen/Kleene (FG, BCR), pp. 17–31.
PPDP-2002-HiguchiO #bytecode #java: Java bytecode as a typed term calculus (TH, AO), pp. 201–211.
PPDP-2002-OstrovskyPT #higher-order #towards: Towards a primitive higher order calculus of broadcasting systems (KO, KVSP, WT), pp. 2–13.
PPDP-2002-Palamidessi #distributed #mobile #programming: Mobile calculi for distributed programming (CP), pp. 74–75.
WRLA-J-1996-GadducciM02 #logic: Comparing logics for rewriting: rewriting logic, action calculi and tile logic (FG, UM), pp. 319–358.
ESOP-2002-Thiemann #dependence #prototype: A Prototype Dependency Calculus (PT), pp. 228–242.
FASE-2002-BradfieldFS #ocl #using #μ-calculus: Enriching OCL Using Observational μ-Calculus (JCB, JKF, PS), pp. 203–217.
FoSSaCS-2002-BorealeG #composition #on the #reasoning: On Compositional Reasoning in the Sπ-calculus (MB, DG), pp. 67–81.
FoSSaCS-2002-FerrariMP #algebra: Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation (GLF, UM, MP), pp. 129–158.
FoSSaCS-2002-Santocanale #category theory #proving #semantics: A Calculus of Circular Proofs and Its Categorical Semantics (LS), pp. 357–371.
TACAS-2002-Mateescu #lts #model checking #μ-calculus: Local Model-Checking of Modal μ-Calculus on Acyclic Labeled Transition Systems (RM), pp. 281–295.
WRLA-2002-CirsteaKL: Rewriting Calculus with(out) Types (HC, CK, LL), pp. 3–19.
CADE-2002-KupfermanSV #complexity: The Complexity of the Graded µ-Calculus (OK, US, MYV), pp. 423–437.
CSL-2002-BerwangerGL #on the #μ-calculus: On the Variable Hierarchy of the Modal μ-Calculus (DB, EG, GL), pp. 352–366.
CSL-2002-Niwinski #game studies #μ-calculus: μ-Calculus via Games (DN), pp. 27–43.
LICS-2002-EdalatL #difference: Domain Theory and Differential Calculus (Functions of one Variable) (AE, AL), pp. 277–286.
LICS-2002-ReusS #logic #semantics: Semantics and Logic of Object Calculi (BR, TS), p. 113–?.
LICS-2002-Statman #on the: On The λ Y Calculus (RS), pp. 159–166.
WCRE-2001-HarmanHDHLF #slicing: Node Coarsening Calculi for Program Slicing (MH, RMH, SD, JH, MRL, CF), pp. 25–34.
RTA-2001-Struth #transitive: Deriving Focused Calculi for Transitive Relations (GS), pp. 291–305.
TLCA-2001-deLiguoro #convergence: Characterizing Convergent Terms in Object Calculi via Intersection Types (Ud), pp. 315–328.
TLCA-2001-Jay #data type: Distinguishing Data Structures and Functions: The Constructor Calculus and Functorial Types (CBJ), pp. 217–239.
TLCA-2001-Miquel: The Implicit Calculus of Constructions (AM), pp. 344–359.
TLCA-2001-Normann: Definability of Total Objects in PCF and Related Calculi (DN), pp. 4–5.
FLOPS-2001-Hortala-GonzalezU #automaton #lazy evaluation: An Abstract Machine Based System for a Lazy Narrowing Calculus (MTHG, EU), pp. 216–232.
FLOPS-2001-SatoSK: A Simply Typed Context Calculus with First-Class Environments (MS, TS, YK), pp. 359–374.
OOPSLA-2001-AnconaLZ #exception #java: A Core Calculus for Java Exceptions (DA, GL, EZ), pp. 16–30.
PADL-2001-Ramakrishnan #logic programming #model checking #using #μ-calculus: A Model Checker for Value-Passing μ-Calculus Using Logic Programming (CRR), pp. 1–13.
POPL-2001-Calcagno #correctness #safety #semantics: Stratified operational semantics for safety and correctness of the region calculus (CC), pp. 155–165.
POPL-2001-Vouillon: Combining subsumption and binary methods: an object calculus with views (JV), pp. 290–303.
SAC-2001-FerrariT #debugging #mobile: A debugging calculus for mobile ambients (GLF, ET).
ESOP-2001-ConchonP #constraints #type inference: JOIN(X): Constraint-Based Type Inference for the Join-Calculus (SC, FP), pp. 221–236.
ESOP-2001-Mitchell #analysis #polynomial #probability #process #protocol #security: Probabilistic Polynomial-Time Process Calculus and Security Protocol Analysis (JCM), pp. 23–29.
FASE-2001-ClarkEK #metamodelling #semantics #uml: The Metamodelling Language Calculus: Foundation Semantics for UML (TC, AE, SK), pp. 17–31.
FASE-2001-ReusWH #design #hoare #java #modelling #ocl #verification: A Hoare Calculus for Verifying Java Realizations of OCL-Constrained Design Models (BR, MW, RH), pp. 300–317.
FoSSaCS-2001-BuscemiS #petri net: High-Level Petri Nets as Type Theories in the Join Calculus (MGB, VS), pp. 104–120.
TACAS-2001-BolligLW #model checking #parallel #μ-calculus: Parallel Model Checking for the Alternation Free μ-Calculus (BB, ML, MW), pp. 543–558.
CAV-2001-GrumbergHS #distributed #model checking #μ-calculus: Distributed Symbolic Model Checking for μ-Calculus (OG, TH, AS), pp. 350–362.
CSL-2001-GuglielmiS #commutative: Non-commutativity and MELL in the Calculus of Structures (AG, LS), pp. 54–68.
IJCAR-2001-BeckertS #first-order #logic: A Sequent Calculus for First-Order Dynamic Logic with Trace Modalities (BB, SS), pp. 626–641.
IJCAR-2001-LetzS #named #proving #theorem proving: DCTP — A Disconnection Calculus Theorem Prover — System Abstract (RL, GS), pp. 381–385.
IJCAR-2001-SattlerV #hybrid: The Hybrid µ-Calculus (US, MYV), pp. 76–91.
LICS-2001-Blanqui: Definitions by Rewriting in the Calculus of Constructions (FB), pp. 9–18.
LICS-2001-JaninL #monad #μ-calculus: Relating Levels of the μ-Calculus Hierarchy and Levels of the Monadic Hierarchy (DJ, GL), pp. 347–356.
LICS-2001-MitchellRST #analysis #probability #process #protocol #security: Probabilistic Polynominal-Time Process Calculus and Security Protocol Analysis (JCM, AR, AS, VT), pp. 3–5.
LICS-2001-Terui #normalisation: Light Affine Calculus and Polytime Strong Normalization (KT), pp. 209–220.
ICALP-2000-Buresh-OppenheimCIP: Homogenization and the Polynominal Calculus (JBO, MC, RI, TP), pp. 926–937.
RTA-2000-Stuber #convergence #term rewriting: Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems (JS), pp. 229–245.
KR-2000-ShapiroPLL: Iterated Belief Change in the Situation Calculus (SS, MP, YL, HJL), pp. 527–538.
TOOLS-EUROPE-2000-CanalFTV #corba #interface #protocol: Extending CORBA Interfaces with p-Calculus for Protocol Compatibility (CC, LF, JMT, AV), pp. 208–225.
PPDP-2000-Faggian #clustering #commutative #proving: Proof construction and non-commutativity: a cluster calculus (CF), pp. 80–91.
SAS-2000-AmatoL #abstract interpretation #semantics: Abstract Interpretation Based Semantics of Sequent Calculi (GA, GL), pp. 38–57.
ESOP-2000-FisherRR #compilation: A Calculus for Compiling and Linking Classes (KF, JHR, JGR), pp. 135–149.
ESOP-2000-MachkasovaT #compilation: A Calculus for Link-Time Compilation (EM, FAT), pp. 260–274.
FoSSaCS-2000-BartheR #induction #type system: Constructor Subtyping in the Calculus of Inductive Constructions (GB, FvR), pp. 17–34.
FoSSaCS-2000-Merro #locality: Locality and Polyadicity in Asynchronous Name-Passing Calculi (MM), pp. 238–251.
FoSSaCS-2000-YangR #on the #refinement #semantics: On the Semantics of Refinement Calculi (HY, USR), pp. 359–374.
STOC-2000-AlekhnovichBRW #complexity: Space complexity in propositional calculus (MA, EBS, AAR, AW), pp. 358–367.
WRLA-2000-CirsteaK: The simply typed rewriting calculus (HC, CK), pp. 24–42.
WRLA-2000-Stehr #named: CINNI — A Generic Calculus of Explicit Substitutions and its Application to λ-, ς- and pi- Calculi (MOS), pp. 70–92.
CADE-2000-Gillard #concurrent #formal method: A Formalization of a Concurrent Object Calculus up to alpha-Conversion (GG), pp. 417–432.
CL-2000-ArenasBK #consistency #database #query: Applications of Annotated Predicate Calculus to Querying Inconsistent Databases (MA, LEB, MK), pp. 926–941.
CL-2000-HolldoblerS #diagrams #problem #using: Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams (SH, HPS), pp. 747–761.
CL-2000-LehmannL #decidability: Decidability Results for the Propositional Fluent Calculus (HL, ML), pp. 762–776.
CL-2000-StorrT #equation: A New Equational Foundation for the Fluent Calculus (HPS, MT), pp. 733–746.
CSL-2000-Naijun #higher-order: Completeness of Higher-Order Duration Calculus (ZN), pp. 442–456.
LICS-2000-Prost #dependence: A Static Calculus of Dependencies for the λ-Cube (FP), pp. 267–276.
LICS-2000-Voronkov #how #logic #proving: How to Optimize Proof-Search in Modal Logics: A New Way of Proving Redundancy Criteria for Sequent Calculi (AV), pp. 401–412.
ICALP-1999-Miculan #formal method #induction #lazy evaluation #proving #μ-calculus: Formalizing a Lazy Substitution Proof System for μ-calculus in the Calculus of Inductive Constructions (MM), pp. 554–564.
FM-v1-1999-Rouzaud #refinement: Interpreting the B-Method in the Refinement Calculus (YR), pp. 411–430.
FM-v2-1999-LangLL #framework: A Framework for Defining Object-Calculi (FL, PL, LL), pp. 963–982.
FM-v2-1999-SmarandacheGG #constraints #realtime #validation: Validation of Mixed SIGNAL-ALPHA Real-Time Systems through Affine Calculus on Clock Synchronisation Constraints (IMS, TG, PLG), pp. 1364–1383.
IFM-1999-Hennessy #message passing #process #proving: Proof Systems for Message-Passing Process Calculi (MH), p. 26.
IFM-1999-StoddartD #modelling #refinement: The Refinement of Event Calculus Models (BS, SD), pp. 151–169.
RTA-1999-BlanquiJO #algebra: The Calculus of algebraic Constructions (FB, JPJ, MO), pp. 301–316.
FLOPS-1999-BartheS #partial evaluation: Partial Evaluation and Non-inference for Object Calculi (GB, BPS), pp. 53–67.
ECOOP-1999-BonoPS #mixin: A Core Calculus of Classes and Mixins (VB, AP, VS), pp. 43–66.
OOPSLA-1999-IgarashiPW #java: Featherweight Java: A Minimal Core Calculus for Java and GJ (AI, BCP, PW), pp. 132–146.
TOOLS-ASIA-1999-WangLPZZ #approach #development #formal method #refinement: A Formal Software Development Approach Based on COOZ and Refinement Calculus (YW, BL, JP, MZ, GZ), pp. 261–266.
POPL-1999-AbadiBHR #dependence: A Core Calculus of Dependency (MA, AB, NH, JGR), pp. 147–160.
POPL-1999-CraryWM #memory management: Typed Memory Management in a Calculus of Capabilities (KC, DW, JGM), pp. 262–275.
PPDP-1999-AnconaZ: A Primitive Calculus for Module Systems (DA, EZ), pp. 62–79.
PPDP-1999-FernandezM #interactive: A Calculus for Interaction Nets (MF, IM), pp. 170–187.
PPDP-1999-LopesSV #process #virtual machine: A Virtual Machine for a Process Calculus (LMBL, FMAS, VTV), pp. 244–260.
FASE-1999-BruniMM #execution #process #specification: Executable Tile Specifications for Process Calculi (RB, JM, UM), pp. 60–76.
FoSSaCS-1999-Boer #object-oriented: A WP-calculus for OO (FSdB), pp. 135–149.
FoSSaCS-1999-NarasimhaCI #logic #probability #μ-calculus: Probabilistic Temporal Logics via the Modal μ-Calculus (MN, RC, SPI), pp. 288–305.
STOC-1999-BussGIP #linear #polynomial: Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes (SRB, DG, RI, TP), pp. 547–556.
CADE-1999-BaumgartnerEF #confluence: A Confluent Connection Calculus (PB, NE, UF), pp. 329–343.
LICS-1999-DrossopoulouEW #compilation #towards: A Fragment Calculus — Towards a Model of Separate Compilation, Linking and Binary Compatibility (SD, SE, DW), pp. 147–156.
ICALP-1998-FournetG: A Hierarchy of Equivalences for Asynchronous Calculi (CF, GG), pp. 844–855.
ICALP-1998-MerroS #on the: On Asynchrony in Name-Passing Calculi (MM, DS), pp. 856–867.
ICALP-1998-VictorP #concurrent #constraints: Concurrent Constraints in the Fusion Calculus (BV, JP), pp. 455–469.
ICFP-1998-Faggian #approach: A Term Calculus for Unitary Approach to Nomalization (CF), p. 347.
KR-1998-CervesatoFM #complexity #model checking #quantifier: The Complexity of Model Checking in Modal Event Calculi with Quantifiers (IC, MF, AM), pp. 368–379.
KR-1998-Lifschitz #logic: Situation Calculus and Causal Logic (VL), pp. 536–546.
KR-1998-Renz #canonical: A Canonical Model of the Region Connection Calculus (JR), pp. 330–341.
ECOOP-1998-BonoF #first-order #imperative: An Imperative, First-Order Calculus with Object Extension (VB, KF), pp. 462–497.
POPL-1998-AriolaS #call-by #correctness #imperative #monad: Correctness of Monadic State: An Imperative Call-by-Need Calculus (ZMA, AS), pp. 62–74.
POPL-1998-HeintzeR #programming: The SLam Calculus: Programming with Secrecy and Integrity (NH, JGR), pp. 365–377.
FASE-1998-Scholz #refinement: A Refinement Calculus for Statecharts (PS), pp. 285–301.
TACAS-1998-Sprenger #coq #model checking #μ-calculus: A Verified Model Checker for the Modal μ-calculus in Coq (CS), pp. 167–183.
WRLA-1998-Jouannaud #equation #induction #logic: Membership equational logic, calculus of inductive instructions, and rewrite logic (JPJ), pp. 388–393.
WRLA-1998-Viry #equation: Adventures in sequent calculus modulo equations (PV), pp. 21–32.
CADE-1998-Pagano #first-order #higher-order #reduction: X.R.S : Explicit Reduction Systems — A First-Order Calculus for Higher-Order Calculi (BP), pp. 72–87.
LICS-1998-BorealeS #bisimulation: Bisimulation in Name-Passing Calculi without Matching (MB, DS), pp. 165–175.
LICS-1998-CharatonikMNPW #μ-calculus: The Horn μ-calculus (WC, DAM, DN, AP, IW), pp. 58–69.
LICS-1998-FriasM #relational: Completeness of a Relational Calculus for Program Schemes (MFF, RDM), pp. 127–134.
LICS-1998-ParrowV #mobile #process #symmetry: The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes (JP, BV), pp. 176–185.
LICS-1998-PavlovicE #induction: Calculus in Coinductive Form (DP, MHE), pp. 408–417.
ICALP-1997-BurkartS #infinity #model checking #process #μ-calculus: Model Checking the Full Modal μ-Calculus for Infinite Sequential Processes (OB, BS), pp. 419–429.
ICALP-1997-Milner #interactive #visual notation: Graphical Calculi for Interaction (RM), p. 1.
TLCA-1997-Courant #type system: A Module Calculus for Pure Type Systems (JC), pp. 112–128.
TLCA-1997-Ghani #dependent type #type system: Eta-Expansions in Dependent Type Theory — The Calculus of Constructions (NG), pp. 164–180.
TLCA-1997-Ruess #proving #theorem proving: Computational Reflection in the Calculus of Constructions and its Application to Theorem Proving (HR), pp. 319–335.
CAiSE-1997-DiazP #modelling #policy #validation: Stimuli and Business Policies as Modelling Constructs: Their Definition and Validation Through the Event Calculus (OD, NWP), pp. 33–46.
TOOLS-PACIFIC-1997-ZhangP #modelling: Class-Based Models in the -Calculus (XZ, JP), pp. 238–251.
ALP-1997-SuzukiNI #functional #higher-order #lazy evaluation #logic: Higher-Order Lazy Narrowing Calculus: A Computation Model for a Higher-Order Functional Logic Language (TS, KN, TI), pp. 99–113.
PLILP-1997-CompagnoniF #algebra #on the: On Object Calculus with Algebraic Rewriting (ABC, MF), pp. 17–31.
STOC-1997-RazborovWY #branch #proving #source code: Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus (AAR, AW, ACCY), pp. 739–748.
TAPSOFT-1997-Breugel #lts: A Labelled Transition Systems for pi-epsilon-Calculus (FvB), pp. 321–332.
TAPSOFT-1997-Courant: An Applicative Module Calculus (JC), pp. 622–636.
CADE-1997-RousselM #compilation: Exact Kanowledge Compilation in Predicate Calculus: The Partial Achievement Case (OR, PM), pp. 161–175.
CAV-1997-Biere #model checking #named #performance #μ-calculus: μcke — Efficient μ-Calculus Model Checking (AB), pp. 468–471.
CAV-1997-PardoH #abstraction #automation #model checking #μ-calculus: Automatic Abstraction Techniques for Propositional μ-calculus Model Checking (AP, GDH), pp. 12–23.
CSL-1997-BarberGHP #linear #logic: From Action Calculi to Linear Logic (AB, PG, MH, GDP), pp. 78–97.
CSL-1997-BonattiO: A Sequent Calculus for Circumscription (PAB, NO), pp. 98–114.
ICLP-1997-BaumgartnerF #logic programming: Calculi for Disjunctive Logic Programming (PB, UF), p. 409.
ICLP-1997-CervesatoFM #complexity #model checking: The Complexity of Model Checking in Modal Event Calculi (IC, MF, AM), p. 419.
ILPS-1997-Arenas-SanchezR #algebra #functional #lazy evaluation #logic programming #polymorphism: A Lazy Narrowing Calculus for Functional Logic Programming with Algebraic Polymorphic Types (PAS, MRA), pp. 53–67.
ILPS-1997-BaumgartnerF #logic programming: Calculi for Disjunctive Logic Programming (PB, UF), pp. 229–243.
LICS-1997-Janin #automaton #fixpoint #reduction #theorem: Automata, Tableaus and a Reduction Theorem for Fixpoint Calculi in Arbitrary Complete Lattices (DJ), pp. 172–182.
LICS-1997-Kobayashi #concurrent #process: A Partially Deadlock-Free Typed Process Calculus (NK0), pp. 128–139.
ICALP-1996-BradfieldEM #effectiveness #linear #μ-calculus: An Effective Tableau System for the Linear Time μ-Calculus (JCB, JE, AM), pp. 98–109.
ICALP-1996-Lenzi #theorem #μ-calculus: A Hierarchy Theorem for the μ-Calculus (GL), pp. 87–97.
ICALP-1996-Pin #automaton #first-order #power of: The Expressive Power of Existential First Order Sentences of Büchi’s Sequential Calculus (JÉP), pp. 300–311.
ICFP-1996-HardinMP #functional: Functional Back-Ends within the λσ Calculus (TH, LM, BP), pp. 25–33.
KR-1996-Giunchiglia: Determining Ramifications in the Situation Calculus (EG), pp. 76–86.
KR-1996-Kelley #case study #modelling #problem #using: Modeling Complex Systems in the Situation Calculus: A Case Study Using the Dagstuhl Steam Boiler Problem (TGK), pp. 26–37.
KR-1996-Lakemeyer: Only Knowing in the Situation Calculus (GL), pp. 14–25.
KR-1996-MillerS #reasoning: Reasoning about Discontinuities in the Event Calculus (RM, MS), pp. 63–74.
KR-1996-Reiter #concurrent: Natural Actions, Concurrency and Continuous Time in the Situation Calculus (RR), pp. 2–13.
POPL-1996-FournetG #reflexive: The Reflexive CHAM and the Join-Calculus (CF, GG), pp. 372–385.
POPL-1996-GordonR #first-order #similarity #type system: Bisimilarity for a First-Order Calculus of Objects with Subtyping (ADG, GDR), pp. 386–395.
TAPSOFT-J-1995-Sangiorgi96a #π-calculus: pi-Calculus, Internal Mobility, and Agent-Passing Calculi (DS), pp. 235–274.
RWLW-1996-Lechner #distributed #maude #object-oriented #specification #μ-calculus: Object-oriented specifications of distributed systems in the μ-Calculus and Maude (UL), pp. 385–404.
TACAS-1996-BhatC #model checking #μ-calculus: Efficent Local Model-Checking for Fragments of teh Modal μ-Calculus (GB, RC), pp. 107–126.
TACAS-1996-Stirling #game studies #μ-calculus: Games and Modal μ-Calculus (CS), pp. 298–312.
CADE-1996-Felty #proving #set: Proof Search with Set Variable Instantiation in the Calculus of Constructions (APF), pp. 658–672.
CADE-1996-Nonnengart #logic: Resolution-Based Calculi for Modal and Temporal Logics (AN), pp. 598–612.
CSL-1996-Gore #algebra: Cut-free Display Calculi for Relation Algebras (RG), pp. 198–210.
JICSLP-1996-BugliesiDML #linear #logic: A Linear Logic Calculus Objects (MB, GD, LL, MM), pp. 67–81.
JICSLP-1996-DeneckerBDPS #empirical #information management #protocol #representation #specification: A Realistic Experiment in Knowledge Representation in Open Event Calculus: Protocol Specification (MD, KVB, GD, FP, DDS), pp. 170–184.
LICS-1996-BhatC #equation #model checking #performance #μ-calculus: Efficient Model Checking via the Equational μ-Calculus (GB, RC), pp. 304–312.
LICS-1996-Munoz #confluence #normalisation: Confluence and Preservation of Strong Normalisation in an Explicit Substitutions Calculus (CAM), pp. 440–447.
LICS-1996-Seidl #μ-calculus: A Modal μ-Calculus for Durational Transition Systems (HS), pp. 128–137.
SIGMOD-1995-FegarasM #effectiveness #query #towards: Towards an Effective Calculus for Object Query Languages (LF, DM), pp. 47–58.
ICALP-1995-Sangiorgi: Internal Mobility and Agent-Passing Calculi (DS), pp. 672–683.
TLCA-1995-Groote #exception: A Simple Calculus of Exception Handling (PdG), pp. 201–215.
PLILP-1995-NakaharaMI #functional #higher-order #logic programming: A Complete Narrowing Calculus for Higher-Order Functional Logic Programming (KN, AM, TI), pp. 97–114.
SAS-1995-Schmidt-SchausPS #reduction #using: Abstract Reduction Using a Tableau Calculus (MSS, SEP, MS), pp. 348–365.
ESOP-J-1994-Prasad95: A Calculus of Broadcasting Systems (KVSP), pp. 285–327.
TACAS-1995-Mader #model checking #μ-calculus: Modal μ-Calculus, Model Checking and Gauß Elimination (AM), pp. 72–88.
TAPSOFT-1995-AbadiC #imperative: An Imperative Object Calculus (MA, LC), pp. 471–485.
TAPSOFT-1995-Sangiorgi #named #symmetry: Pi-I: A Symmetric Calculus Based on Internal Mobility (DS), pp. 172–186.
CAV-1995-BouajjaniLR #automaton #hybrid #linear: From Duration Calculus To Linear Hybrid Automata (AB, YL, RR), pp. 196–210.
CAV-1995-Emerson #model checking #tutorial #μ-calculus: Methods for μ-calculus Model Checking: A Tutorial (EAE), p. 141.
CAV-1995-Rauzy #constraints #μ-calculus: Toupie = μ-Calculus + Constraints (AR), pp. 114–126.
ICLP-1995-BelleghemDS: Combining Situation Calculus and Event Calculus (KVB, MD, DDS), pp. 83–97.
ICLP-1995-CervesatoCM #framework #logic programming #order: A Modal Calculus of Partially Ordered Events in a Logic Programming Framework (IC, LC, AM), pp. 299–313.
ICLP-1995-SadriK: Variants of the Event Calculus (FS, RAK), pp. 67–81.
ICLP-1995-Sripada #database #implementation #performance: Efficient Implementation of the Event Calculus for Temporal Database Applications (SMS), pp. 99–113.
LICS-1995-GayN #process: A Typed Calculus of Synchronous Processes (SJG, RN), pp. 210–220.
LICS-1995-Walukiewicz #axiom #μ-calculus: Completeness of Kozen’s Axiomatisation of the Propositional μ-Calculus (IW), pp. 14–24.
PODS-1994-OhoriT #polymorphism: A Polymorphic Calculus for Views and Object Sharing (AO, KT), pp. 255–266.
KR-1994-Schild: Terminological Cycles and the Propositional µ-Calculus (KS), pp. 509–520.
SEKE-1994-Sakalauskaite #branch #first-order #logic: A complete sequent calculus for a first order branching temporal logic (JS), pp. 274–280.
POPL-1994-Lescanne: From λσ to λν: a Journey Through Calculi of Explicit Substitutions (PL), pp. 60–69.
POPL-1994-Muller #staging #verification: A Staging Calculus and its Application to the Verification of Translators (RM), pp. 389–396.
CADE-1994-Eriksson #editing #induction #interactive #named: Pi: an Interactive Derivation Editor for the Calculus of Partial Inductive Definitions (LHE), pp. 821–825.
CAV-1994-SokolskyS #incremental #model checking #μ-calculus: Incremental Model Checking in the Modal μ-Calculus (OS, SAS), pp. 351–363.
ICLP-1994-BelleghemDS #abduction #representation: Representing Continuous Change in the Abductive Event Calculus (KVB, MD, DDS), pp. 225–239.
ILPS-1994-BroomeL #combinator #logic programming: Combinatory Logic Programming: Computing in Relation Calculi (PB, JL), pp. 269–285.
ILPS-1994-CervesatoCM: Modal Event Calculus (IC, LC, AM), p. 675.
ILPS-1994-KowalskiS: The Situation Calculus and Event Calculus Compared (RAK, FS), pp. 539–553.
LICS-1994-AndersenSW #composition #proving #μ-calculus: A Compositional Proof System for the Modal μ-Calculus (HRA, CS, GW), pp. 144–153.
LICS-1994-LincolnS #first-order #linear #logic #proving: Proof Search in First-Order Linear Logic and Other Cut-Free Sequent Calculi (PL, NS), pp. 282–291.
LICS-1994-Pentus: Language Completeness of the Lambek Calculus (MP), pp. 487–496.
LICS-1994-ZhangSS #complexity #model checking #on the #parallel #μ-calculus: On the Parallel Complexity of Model Checking in the Modal μ-Calculus (SZ, OS, SAS), pp. 154–163.
PODS-1993-Escobar-MolanoHJ #query #safety: Safety and Translation of Calculus Queries with Scalar Functions (MEM, RH, DJ), pp. 253–264.
SIGMOD-1993-Watters #relational: Interpreting a Reconstructed Relational Calculus (AW), pp. 367–376.
ICALP-1993-HavelundL: The Fork Calculus (KH, KGL), pp. 544–557.
FME-1993-Ward #refinement #specification: Adding Specification Constructors to the Refinement Calculus (NW), pp. 652–670.
TLCA-1993-Akama #on the #reduction: On Mints’ Reduction for ccc-Calculus (YA), pp. 1–12.
TLCA-1993-BentonBPH #linear #logic: A Term Calculus for Intuitionistic Linear Logic (PNB, GMB, VdP, MH), pp. 75–90.
TLCA-1993-CastagnaGL #semantics: A Semantics for λ&-early: A Calculus with Overloading and Early Binding (GC, GG, GL), pp. 107–123.
TLCA-1993-Dowek: The Undecidability of Typability in the λ-π-Calculus (GD), pp. 139–145.
SEKE-1993-Eberbach #algorithm #design #self #specification: The Design and Specification of SEMAL — A Cost Language Based on the Calculus of Self-Modifiable Algorithms (EE), pp. 166–173.
ECOOP-1993-SatohT #distributed: A Timed Calculus for Distributed Objects with Clocks (IS, MT), pp. 326–345.
FSE-1993-Wood #approach #re-engineering #refinement #using: A Practical Approach to Software Engineering Using Z and the Refinement Calculus (KRW), pp. 79–88.
SAC-1993-ClementiniF #database: An Object Calculus for Geographic Databases (EC, PDF), pp. 302–308.
TAPSOFT-1993-LatellaQ #parallel #process: A Fully Parallel Calculus of Synchronizing Processes (DL, PQ), pp. 732–745.
CAV-1993-EmersonJS #model checking #on the #μ-calculus: On Model-Checking for Fragments of μ-Calculus (EAE, CSJ, APS), pp. 385–396.
CSL-1993-AmblerKM #on the #μ-calculus: On Duality for the Modal μ-Calculus (SA, MZK, NM), pp. 18–32.
CSL-1993-Milner #higher-order: Higher-Order Action Calculi (RM), pp. 238–260.
CSL-1993-OngR #normalisation: A Generic Strong Normalization Argument: Application to the Calculus of Constructions (CHLO, ER), pp. 261–279.
ICLP-1993-PintoR #logic programming #reasoning: Temporal Reasoning in Logic Programming: A Case for the Situation Calculus (JP, RR), pp. 203–221.
PODS-1992-Ross #algebra: Relations with Relation Names as Arguments: Algebra and Calculus (KAR), pp. 346–353.
LFP-1992-BoveA #confluence #evaluation #metaprogramming: A Confluent Calculus of Macro Expansion and Evaluation (AB, LA), pp. 278–287.
LFP-1992-CastagnaGL #type system: A Calculus for Overloaded Functions with Subtyping (GC, GG, GL), pp. 182–192.
ALP-1992-Ait-Kaci #object-oriented: Outline of an Object-Oriented Calculus of Higher Type (HAK), pp. 1–2.
POPL-1992-Ohori #compilation #polymorphism: A Compilation Method for ML-Style Polymorphic Record Calculi (AO), pp. 154–165.
WSA-1992-CorsiniMR #finite #prolog #semantics #μ-calculus: The μ-Calculus over Finite Domains as an Abstract Semantics of Prolog (MMC, KM, AR), pp. 51–59.
CADE-1992-BenhamouS #symmetry: Theoretical Study of Symmetries in Propositional Calculus and Applications (BB, LS), pp. 281–294.
CADE-1992-Shankar #proving: Proof Search in the Intuitionistic Sequent Calculus (NS), pp. 522–536.
CAV-1992-CleavelandKS #model checking #performance #μ-calculus: Faster Model Checking for the Modal μ-Calculus (RC, MK, BS), pp. 410–422.
JICSLP-1992-Cerrito #ll #unification: Herbrand Methods in Sequent Calculi: Unification in LL (SC), pp. 607–621.
LICS-1992-Pratt: Origins of the Calculus of Binary Relations (VRP), pp. 248–254.
LICS-1992-Stark #data flow #network: A Calculus of Dataflow Networks (EWS), pp. 125–136.
VDME-1991-Woodcock #refinement #tutorial: A Tutorial on the Refinement Calculus (JW), pp. 79–140.
VDME-1991-Woodcock91a #refinement: The Refinement Calculus (JW), pp. 80–95.
ECOOP-1991-HondaT #communication: An Object Calculus for Asynchronous Communication (KH, MT), pp. 133–147.
POPL-1991-HarperP #symmetry: A Record Calculus Based on Symmetric Concatenation (RH, BCP), pp. 131–142.
CAAP-1991-KasangianV: Introducing a Calculus of Trees (SK, SV), pp. 215–240.
CAAP-1991-NajmS #analysis #concurrent #process: Object-Based Concurrency: A Process Calculus Analysis (EN, JBS), pp. 359–380.
CAAP-1991-Prasad: A Calculus of Broadcasting Systems (KVSP), pp. 338–358.
CAV-1991-CleavelandS #algorithm #linear #model checking #μ-calculus: A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal μ-Calculus (RC, BS), pp. 48–58.
LICS-1991-Audebaud: Partial Objects in the Calculus of Constructions (PA), pp. 86–95.
LICS-1991-Pfenning #anti #unification: Unification and Anti-Unification in the Calculus of Constructions (FP), pp. 74–85.
PODS-1990-Willard #algorithm #relational: Quasilinear Algorithms for Processing Relational Calculus Expressions (DEW), pp. 243–257.
ICALP-1990-JagadeesanP #formal method #higher-order #process: A Domain-Theoretic Model for a Higher-Order Process Calculus (RJ, PP), pp. 181–194.
VDME-1990-Hall #object-oriented #specification #using: Using Z as a Specification Calculus for Object-Oriented Systems (AH), pp. 290–318.
VDME-1990-King #refinement: Z and the Refinement Calculus (SK), pp. 164–188.
ALP-1990-SimonisD #problem: Propositional Calculus Problems in CHIP (HS, MD), pp. 189–203.
PLILP-1990-Asperti #evaluation #lazy evaluation #strict: Integrating Strict and Lazy Evaluation: The λ-sl-Calculus (AA), pp. 238–254.
CAV-1990-Langevin #automation #verification: Automated RTL Verification Based on Predicate Calculus (ML), pp. 116–125.
LICS-1990-LassezM #constraints: A Constraint Sequent Calculus (JLL, KM), pp. 52–61.
ICALP-1989-Winskel #model checking: A Note on Model Checking the Modal nu-Calculus (GW), pp. 761–772.
KR-1989-Pednault #named: ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus (EPDP), pp. 324–332.
KR-1989-SubramanianW: Making Situation Calculus Indexical (DS, JW), pp. 467–474.
POPL-1989-Paulin-Mohring #proving #source code: Extracting Fω’s Programs from Proofs in the Calculus of Constructions (CPM), pp. 89–104.
POPL-1989-Thomsen #communication #higher-order: A Calculus of Higher Order Communicating Systems (BT), pp. 143–154.
ESEC-1989-NardiT #representation: An Application of the Event Calculus for Representing the History of a Software Project (DN, MT), pp. 176–190.
CAAP-1989-StirlingW #model checking: Local Model Checking in the Modal Mu-Calculus (CS, DW), pp. 369–383.
CCIPL-1989-HarperP #ambiguity #morphism #polymorphism #type checking: Type Checking, Universe Polymorphism, and Typical Ambiguity in the Calculus of Constructions (Draft) (RH, RP), pp. 241–256.
CSL-1989-Mey: A Predicate Calculus with Control of Derivations (DM), pp. 254–266.
LICS-1989-Luo: ECC, an Extended Calculus of Constructions (ZL), pp. 386–395.
POPL-1988-Vardi #fixpoint: A Temporal Fixpoint Calculus (MYV), pp. 250–259.
CADE-1988-Ohlbach #logic: A Resolution Calculus for Modal Logics (HJO), pp. 500–516.
CADE-1988-Pfenning #axiom: Single Axioms in the Implicational Propositional Calculus (FP), pp. 710–713.
CSL-1988-Eder #comparison: A Comparison of the Resolution Caculus and the Connection Method, and a new Calculus Generalizing Both Methods (EE), pp. 80–98.
JICSCP-1988-Eshghi88 #abduction: Abductive Planning with Event Calculus (KE), pp. 562–579.
LICS-1988-BohmP: Characterizing X-Separability and One-Side Invertibility in λ-β-Ω-Calculus (CB, AP), pp. 91–101.
PODS-1987-GelderT #relational #safety: Safety and Correct Translation of Relational Calculus Formulas (AVG, RWT), pp. 313–327.
POPL-1987-FelleisenF #higher-order: A Calculus for Assignments in Higher-Order Languages (MF, DPF), pp. 314–325.
DAC-1987-BeckerHKMO #design: Hierarchical Design Based on a Calculus of Nets (BB, GH, RK, PM, HGO), pp. 649–653.
AS-1987-AstesianoR #concurrent: SMoLCS-Driven Concurrent Calculi (EA, GR), pp. 169–201.
AS-1987-Huet #induction: Induction Principles Formalized in the Calculus of Constructions (GPH), pp. 276–286.
SLP-1987-SannellaW87 #composition #prolog #source code: A Calculus for the Construction of Modular Prolog Programs (DS, LAW), pp. 368–378.
PODS-1986-BancilhonK: A Calculus for Complex Objects (FB, SK), pp. 53–60.
LICS-1986-EmersonL #model checking #performance #μ-calculus: Efficient Model Checking in Fragments of the Propositional μ-Calculus (EAE, CLL), pp. 267–278.
LICS-1986-Mohring #algorithm #development: Algorithm Development in the Calculus of Constructions (CM), pp. 84–91.
LICS-1986-RoundsK #logic #representation: A Complete Logical Calculus for Record Structures Representing Linguistic Information (WCR, RTK), pp. 38–43.
SIGMOD-1984-Willard #performance #query #relational #using: Efficient Processing of Relational Calculus Expressions Using Range Query Theory (DEW), pp. 164–175.
ICALP-1984-StreettE #μ-calculus: The Propositional μ-Calculus is Elementary (RSS, EAE), pp. 465–472.
CADE-1984-Gelder #satisfiability: A Satisfiability Tester for Non-Clausal Propositional Calculus (AVG), pp. 101–112.
DAC-1983-Bhavsar #algorithm #design: Design For Test Calculus: An algorithm for DFT rules checking (DKB), pp. 300–307.
SIGMOD-1982-BernsteinB #performance #quantifier #relational #testing: Fast Methods for Testing Quantified Relational Calculus Assertions (PAB, BTB), pp. 39–50.
VLDB-1982-LouisP #relational #semantics: A Denotational Definition of the Semantics of DRC, A Domain Relational Calculus (GL, AP), pp. 348–356.
ICALP-1982-Kozen #μ-calculus: Results on the Propositional μ-Calculus (DK), pp. 348–359.
STOC-1981-KrishnamurthyM: Examples of Hard Tautologies in the Propositional Calculus (BK, RNM), pp. 28–37.
VLDB-1980-Demolombe #estimation #query #tuple: Estimation of the Number of Tuples Satisfying a Query Expressed in Predicate Calculus Language (RD), pp. 55–63.
VLDB-1979-Demolombe #semantics: Semantic Checking of Questions Expressed in Predicate Calculus Language (RD), pp. 444–450.
STOC-1975-Cook #proving: Feasibly Constructive Proofs and the Propositional Calculus (SAC), pp. 83–97.
STOC-1974-CookR #on the #proving: On the Lengths of Proofs in the Propositional Calculus (SAC, RAR), pp. 135–148.
ICALP-1972-BakkerR #recursion: A Calculus for Recursive Program Schemes (JWdB, WPdR), pp. 167–196.
SIGFIDET-1971-Codd #database #relational: A Database Sublanguage Founded on the Relational Calculus (EFC), pp. 35–68.