Stem calculi$ (all stems)

140 papers:

FoSSaCS-2015-GeblerLT #calculus #composition #metric #probability #process #reasoning

Compositional Metric Reasoning with Probabilistic Process Calculi (DG, KGL, ST), pp. 230–245.

ICALP-v1-2015-BeyersdorffCMS #calculus

Feasible Interpolation for QBF Resolution Calculi (OB, LC, MM, AS), pp. 180–192.

TLCA-2015-BucciarelliKR #calculus

Observability for Pair Pattern Calculi (AB, DK, SRDR), pp. 123–137.

ESOP-2014-CrubilleL #bisimulation #call-by #on the #probability #λ-calculus

On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi (RC, UDL), pp. 209–228.

PLDI-2014-CaiGRO #difference #formal method #higher-order #λ-calculus

A theory of changes for higher-order languages: incrementalizing λ-calculi by static differentiation (YC, PGG, TR, KO), p. 17.

FM-2014-SchebenS #calculus #composition #performance #self

Efficient Self-composition for Weakest Precondition Calculi (CS, PHS), pp. 579–594.

IJCAR-2014-GoreOT #calculus #implementation #using

Implementing Tableau Calculi Using BDDs: BDDTab System Description (RG, KO, JT), pp. 337–343.

IJCAR-2014-LahavZ #calculus #satisfiability

SAT-Based Decision Procedure for Analytic Pure Sequent Calculi (OL, YZ), pp. 76–90.

IJCAR-2014-OlivettiP #calculus #implementation #logic #named

NESCOND: An Implementation of Nested Sequent Calculi for Conditional Logics (NO, GLP), pp. 511–518.

PODS-2013-Wong #calculus #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.

ESOP-2013-PetersNG #calculus #on the #process

On Distributability in Process Calculi (KP, UN, UG), pp. 310–329.

LATA-2013-AotoI #calculus #rule-based #termination

Termination of Rule-Based Calculi for Uniform Semi-Unification (TA, MI), pp. 56–67.

CSL-2013-CloustonDGT #calculus #linear #logic

Annotation-Free Sequent Calculi for Full Intuitionistic Linear Logic (RC, JED, RG, AT), pp. 197–214.

LICS-2013-HirschkoffMS #calculus

Name-Passing Calculi: From Fusions to Preorders and Types (DH, JMM, DS), pp. 378–387.

LICS-2013-LairdMMP #modelling #relational #λ-calculus

Weighted Relational Models of Typed λ-Calculi (JL, GM, GM, MP), pp. 301–310.

FLOPS-2012-AriolaDHNS #calculus #call-by #semantics

Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts (ZMA, PD, HH, KN, AS), pp. 32–46.

IJCAR-2012-BaazLZ #calculus #effectiveness #semantics

Effective Finite-Valued Semantics for Labelled Calculi (MB, OL, AZ), pp. 52–66.

LICS-2012-AvronKZ #calculus #composition #logic

Modular Construction of Cut-free Sequent Calculi for Paraconsistent Logics (AA, BK, AZ), pp. 85–94.

LICS-2012-GargGN #calculus #logic #multi

Countermodels from Sequent Calculi in Multi-Modal Logics (DG, VG, SN), pp. 315–324.

RTA-2012-BonelliKLR #calculus #normalisation

Normalisation for Dynamic Pattern Calculi (EB, DK, CL, AR), pp. 117–132.

RTA-2012-Kirchner #calculus #logic

Rho-Calculi for Computation and Logic (Invited Talk) (CK), pp. 2–4.

SEFM-2011-BorgstromHJRVPP #calculus #protocol

Broadcast Psi-calculi with an Application to Wireless Protocols (JB, SH, MJ, PR, BV, JÅP, JP), pp. 74–89.

ICALP-v2-2010-LanesePSS #calculus #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.

ICGT-2010-Monreale #automaton #calculus #encoding #lts #process #semantics #visual notation

LTS Semantics for Process Calculi from Their Graphical Encodings (GVM), pp. 403–406.

KR-2010-Thielscher #calculus

Integrating Action Calculi and AgentSpeak: Closing the Gap (MT).

CSL-2010-AlendaOST #calculus

Tableau Calculi for CSL over minspaces (RA, NO, CS, DT), pp. 52–66.

LICS-2010-JohanssonBPV #calculus

Weak Equivalences in Psi-Calculi (MJ, JB, JP, BV), pp. 322–331.

FoSSaCS-2009-LengletSS #bisimulation #calculus

Normal Bisimulations in Calculi with Passivation (SL, AS, JBS), pp. 257–271.

ICALP-v2-2009-NicolaLLM #calculus #probability #process

Rate-Based Transition Systems for Stochastic Process Calculi (RDN, DL, ML, MM), pp. 435–446.

SFM-2009-Bruni #calculus

Calculi for Service-Oriented Computing (RB), pp. 1–41.

LICS-2009-BengtsonJPV #calculus #logic #mobile #named #process

Psi-calculi: Mobile Processes, Nominal Data, and Logic (JB, MJ, JP, BV), pp. 39–48.

FoSSaCS-2008-KlinS #calculus #probability #process #semantics

Structural Operational Semantics for Stochastic Process Calculi (BK, VS), pp. 428–442.

ICALP-B-2008-JohanssonPVB #π-calculus

Extended π-Calculi (MJ, JP, BV, JB), pp. 87–98.

SFM-2008-VersariG #calculus #implementation #process

pi@: A pi-Based Process Calculus for the Implementation of Compartmentalised Bio-inspired Calculi (CV, RG), pp. 449–506.

KR-2008-RenzL #automation #calculus #complexity #proving

Automated Complexity Proofs for Qualitative Spatial and Temporal Calculi (JR, JJL), pp. 715–723.

CSL-2008-NakazawaTKN #λ-calculus

Undecidability of Type-Checking in Domain-Free Typed λ-Calculi with Existence (KN, MT, YK, HN), pp. 478–492.

CSL-2008-Saurin #on the #λ-calculus #μ-calculus

On the Relations between the Syntactic Theories of λμ-Calculi (AS), pp. 154–168.

LICS-2008-LanesePSS #calculus #decidability #higher-order #on the #process

On the Expressiveness and Decidability of Higher-Order Process Calculi (IL, JAP, DS, AS), pp. 145–155.

ESOP-2007-Versari #analysis #calculus #comparative

A Core Calculus for a Comparative Analysis of Bio-inspired Calculi (CV), pp. 411–425.

FoSSaCS-2007-FerranteM #calculus #μ-calculus

Enriched μ-Calculi Module Checking (AF, AM), pp. 183–197.

CSL-2007-Kesner #calculus #formal method #revisited

The Theory of Calculi with Explicit Substitutions Revisited (DK), pp. 238–252.

LICS-2007-BrotherstonS #calculus #induction #infinity

Complete Sequent Calculi for Induction and Infinite Descent (JB, AS), pp. 51–62.

RTA-2007-CirsteaF #calculus #confluence

Confluence of Pattern-Based Calculi (HC, GF), pp. 78–92.

RTA-2007-Kikuchi #calculus #normalisation #proving

Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi (KK), pp. 257–272.

RTA-2007-Schmidt-Schauss #calculus #correctness

Correctness of Copy in Calculi with Letrec (MSS), pp. 329–343.

TLCA-2007-SantoMP #calculus #continuation #normalisation

Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi (JES, RM, LP), pp. 133–147.

FoSSaCS-2006-PhillipsU #algebra #calculus #process

Reversing Algebraic Process Calculi (ICCP, IU), pp. 246–260.

ICALP-v2-2006-BonattiLMV #calculus #complexity #μ-calculus

The Complexity of Enriched μ-Calculi (PAB, CL, AM, MYV), pp. 540–551.

ICALP-v2-2006-Boreale #calculus #information management #process

Quantifying Information Leakage in Process Calculi (MB), pp. 119–131.

ICLP-2006-GebserS #calculus #programming #set

Tableau Calculi for Answer Set Programming (MG, TS), pp. 11–25.

IJCAR-2006-ZamanskyA #calculus #canonical #quantifier

Canonical Gentzen-Type Calculi with (n, k)-ary Quantifiers (AZ, AA), pp. 251–265.

LICS-2006-FioreS #calculus #congruence #process #semantics

A Congruence Rule Format for Name-Passing Process Calculi from Mathematical Structural Operational Semantics (MPF, SS), pp. 49–58.

ESOP-2005-MakholmW #calculus #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-FerrariMT #calculus #model checking

Model Checking for Nominal Calculi (GLF, UM, ET), pp. 1–24.

FoSSaCS-2005-FocardiRS #calculus #process #security

Bridging Language-Based and Process Calculi Security (RF, SR, AS), pp. 299–315.

SAS-2005-Gordon #calculus #process #security

From Typed Process Calculi to Source-Based Security (ADG), p. 2.

ESOP-2004-PhillipsYE #automaton #calculus #distributed

A Distributed Abstract Machine for Boxed Ambient Calculi (AP, NY, SE), pp. 155–170.

FoSSaCS-2004-GiambiagiSV #behaviour #calculus #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 #calculus

Electoral Systems in Ambient Calculi (IP, MGV), pp. 408–422.

FLOPS-2004-Kahl #calculus #pattern matching

Basic Pattern Matching Calculi: a Fresh View on Matching Failure (WK), pp. 276–290.

ICALP-2004-BusiGZ #calculus #process #recursion #replication

Comparing Recursion, Replication, and Iteration in Process Calculi (NB, MG, GZ), pp. 307–319.

CSL-2004-Ciabattoni #automation #calculus #generative #logic

Automated Generation of Analytic Calculi for Logics with Linearity (AC), pp. 503–517.

CSL-2004-Goubault-LarrecqLNZ #encryption #logic #λ-calculus

Complete Lax Logical Relations for Cryptographic λ-Calculi (JGL, SL, DN, YZ), pp. 400–414.

RTA-2004-Blom #approach #approximate #λ-calculus

An Approximation Based Approach to Infinitary λ Calculi (SB), pp. 221–232.

ASE-2003-Wile #architecture #calculus #non-functional

Architecture Style-Based Calculi for Non-functional Properties (DSW), pp. 299–303.

FoSSaCS-2003-Bonelli #calculus #higher-order #normalisation

A Normalisation Result for Higher-Order Calculi with Explicit Substitutions (EB), pp. 153–168.

ICALP-2003-BusiGZ #calculus #recursion #replication

Replication vs. Recursive Definitions in Channel Based Calculi (NB, MG, GZ), pp. 133–144.

ICALP-2003-GutierrezR #calculus #type system

Expansion Postponement via Cut Elimination in Sequent Calculi for Pure Type Systems (FG, BCR), pp. 956–968.

CSL-2003-MaksimovaV #calculus #complexity #problem

Complexity of Some Problems in Modal and Intuitionistic Calculi (LM, AV), pp. 397–412.

CSL-2003-SatoSKI #calculus

Calculi of Meta-variables (MS, TS, YK, AI), pp. 484–497.

TLCA-2003-SantoP #calculus #multi

Permutative Conversions in Intuitionistic Multiary Sequent Calculi with Cuts (JES, LP), pp. 286–300.

WRLA-J-1996-GadducciM02 #calculus #logic

Comparing logics for rewriting: rewriting logic, action calculi and tile logic (FG, UM), pp. 319–358.

FoSSaCS-2002-FerrariMP #algebra #calculus

Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation (GLF, UM, MP), pp. 129–158.

FLOPS-2002-BarbosaO #calculus #induction #process

Coinductive Interpreters for Process Calculi (LSB, JNO), pp. 183–197.

FME-2002-Basin #calculus #synthesis

The Next 700 Synthesis Calculi (DAB), p. 430.

PPDP-2002-Palamidessi #calculus #distributed #mobile #programming

Mobile calculi for distributed programming (CP), pp. 74–75.

LICS-2002-FioreCB #morphism #λ-calculus

Remarks on Isomorphisms in Typed λ Calculi with Empty and Sum Types (MPF, RDC, VB), p. 147–?.

LICS-2002-ReusS #calculus #logic #semantics

Semantics and Logic of Object Calculi (BR, TS), p. 113–?.

RTA-2002-Struth #calculus

Deriving Focused Lattice Calculi (GS), pp. 83–97.

WCRE-2001-HarmanHDHLF #calculus #slicing

Node Coarsening Calculi for Program Slicing (MH, RMH, SD, JH, MRL, CF), pp. 25–34.

CSL-2001-Akama #algebra #combinator #logic #towards #λ-calculus

Limiting Partial Combinatory Algebras towards Infinitary λ-Calculi and Classical Logic (YA), pp. 399–413.

RTA-2001-Struth #calculus #transitive

Deriving Focused Calculi for Transitive Relations (GS), pp. 291–305.

TLCA-2001-deLiguoro #calculus #convergence

Characterizing Convergent Terms in Object Calculi via Intersection Types (Ud), pp. 315–328.

TLCA-2001-Normann #calculus

Definability of Total Objects in PCF and Related Calculi (DN), pp. 4–5.

FoSSaCS-2000-Merro #calculus #locality

Locality and Polyadicity in Asynchronous Name-Passing Calculi (MM), pp. 238–251.

FoSSaCS-2000-YangR #calculus #on the #refinement #semantics

On the Semantics of Refinement Calculi (HY, USR), pp. 359–374.

WRLA-2000-Stehr #calculus #named

CINNI — A Generic Calculus of Explicit Substitutions and its Application to λ-, ς- and pi- Calculi (MOS), pp. 70–92.

SAS-2000-AmatoL #abstract interpretation #calculus #semantics

Abstract Interpretation Based Semantics of Sequent Calculi (GA, GL), pp. 38–57.

LICS-2000-Voronkov #calculus #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.

RTA-2000-Stuber #calculus #convergence #term rewriting

Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems (JS), pp. 229–245.

FASE-1999-BruniMM #calculus #execution #process #specification

Executable Tile Specifications for Process Calculi (RB, JM, UM), pp. 60–76.

FLOPS-1999-BartheS #calculus #partial evaluation

Partial Evaluation and Non-inference for Object Calculi (GB, BPS), pp. 53–67.

FM-v2-1999-LangLL #calculus #framework

A Framework for Defining Object-Calculi (FL, PL, LL), pp. 963–982.

IFM-1999-Hennessy #calculus #message passing #process #proving

Proof Systems for Message-Passing Process Calculi (MH), p. 26.

ICALP-1998-FournetG #calculus

A Hierarchy of Equivalences for Asynchronous Calculi (CF, GG), pp. 844–855.

ICALP-1998-MerroS #calculus #on the

On Asynchrony in Name-Passing Calculi (MM, DS), pp. 856–867.

KR-1998-CervesatoFM #calculus #complexity #model checking #quantifier

The Complexity of Model Checking in Modal Event Calculi with Quantifiers (IC, MF, AM), pp. 368–379.

CADE-1998-Beeson #unification #λ-calculus

Unification in Lambda-Calculi with if-then-else (MB), pp. 103–118.

CADE-1998-Pagano #calculus #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 #calculus

Bisimulation in Name-Passing Calculi without Matching (MB, DS), pp. 165–175.

PEPM-1997-NielsonN #framework #multi #λ-calculus

Prescriptive Frameworks for Multi-Level λ-Calculi (FN, HRN), pp. 193–202.

ICALP-1997-CosmoG #composition #higher-order #on the #λ-calculus

On Modular Properties of Higher Order Extensional λ Calculi (RDC, NG), pp. 237–247.

ICALP-1997-Milner #calculus #interactive #visual notation

Graphical Calculi for Interaction (Abstract) (RM), p. 1.

CSL-1997-BarberGHP #calculus #linear #logic

From Action Calculi to Linear Logic (AB, PG, MH, GDP), pp. 78–97.

ICLP-1997-BaumgartnerF #calculus #logic programming

Calculi for Disjunctive Logic Programming (PB, UF), p. 409.

ICLP-1997-CervesatoFM #calculus #complexity #model checking

The Complexity of Model Checking in Modal Event Calculi (IC, MF, AM), p. 419.

ILPS-1997-BaumgartnerF #calculus #logic programming

Calculi for Disjunctive Logic Programming (PB, UF), pp. 229–243.

LICS-1997-Janin #automaton #calculus #fixpoint #reduction #theorem

Automata, Tableaus and a Reduction Theorem for Fixpoint Calculi in Arbitrary Complete Lattices (DJ), pp. 172–182.

TLCA-1997-Hasegawa #category theory #modelling #recursion #λ-calculus

Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic λ Calculi (MH), pp. 196–213.

TLCA-1997-Lenisa #induction #semantics #λ-calculus

Semantic Techniques for Deriving Coinductive Characterizations of Observational Equivalences for λ-calculi (ML), pp. 248–266.

TLCA-1997-Urzyczyn #approach #λ-calculus

Inhabitation in Typed λ-Calculi (A Syntactic Approach) (PU), pp. 373–389.

TLCA-1997-Xi #normalisation #λ-calculus

Weak and Strong β Normalisations in Typed λ-Calculi (HX), pp. 390–404.

ALP-1996-FerreiraKP #composition #normalisation #λ-calculus

λ-Calculi with Explicit Substitutions and Composition Which Preserve β-Strong Normalization (MCFF, DK, LP), pp. 284–298.

CADE-1996-Nonnengart #calculus #logic

Resolution-Based Calculi for Modal and Temporal Logics (AN), pp. 598–612.

CSL-1996-Gore #algebra #calculus

Cut-free Display Calculi for Relation Algebras (RG), pp. 198–210.

LICS-1996-HillebrandK #on the #power of #λ-calculus

On the Expressive Power of Simply Typed and Let-Polymorphic λ Calculi (GGH, PCK), pp. 253–263.

RTA-1996-Kesner #confluence #λ-calculus

Confluence Properties of Extensional and Non-Extensional λ-Calculi with Explicit Substitutions (Extended Abstract) (DK), pp. 184–199.

ICALP-1995-Sangiorgi #calculus

Internal Mobility and Agent-Passing Calculi (DS), pp. 672–683.

LICS-1995-KfouryW #normalisation #proving #reduction #semantics #λ-calculus

New Notions of Reduction and Non-Semantic Proofs of β-Strong Normalization in Typed λ-Calculi (AJK, JBW), pp. 311–321.

RTA-1995-KennawayKSV #modelling #λ-calculus

Infinitary λ Calculi and Böhm Models (RK, JWK, MRS, FJdV), pp. 257–270.

TLCA-1995-Mellie #λ-calculus

Typed λ-calculi with explicit substitutions may not terminate (PAM), pp. 328–334.

PODS-1994-HillebrandK #database #functional #order #query #λ-calculus

Functional Database Query Languages as Typed Lambda Calculi of Fixed Order (GGH, PCK), pp. 222–231.

ICALP-1994-CosmoK #algebra #first-order #recursion #term rewriting #λ-calculus

Combining First Order Algebraic Rewriting Systems, Recursion and Extensional λ Calculi (RDC, DK), pp. 462–472.

POPL-1994-Bloom #communication #higher-order #named #λ-calculus

CHOCOLATE: Calculi of Higher Order COmmunication and LAmbda TErms (BB), pp. 339–347.

POPL-1994-Lescanne #calculus

From λσ to λν: a Journey Through Calculi of Explicit Substitutions (PL), pp. 60–69.

ILPS-1994-BroomeL #calculus #combinator #logic programming

Combinatory Logic Programming: Computing in Relation Calculi (PB, JL), pp. 269–285.

LICS-1994-LincolnS #calculus #first-order #linear #logic #proving

Proof Search in First-Order Linear Logic and Other Cut-Free Sequent Calculi (PL, NS), pp. 282–291.

CSL-1993-Milner #calculus #higher-order

Higher-Order Action Calculi (RM), pp. 238–260.

CSL-1993-Ritter #normalisation #λ-calculus

Normalization for Typed λ Calculi with Explicit Substitution (ER), pp. 295–304.

RTA-1993-Dougherty #λ-calculus

Some λ Calculi with Categorial Sums and Products (DJD), pp. 137–151.

TLCA-1993-Jacobs #semantics #λ-calculus

Semantics of λ-I and of other substructure λ calculi (BJ0), pp. 195–208.

TLCA-1993-Takahashi #λ-calculus

λ-Calculi with Conditional Rules (MT), pp. 406–417.

POPL-1992-Ohori #calculus #compilation #polymorphism

A Compilation Method for ML-Style Polymorphic Record Calculi (AO), pp. 154–165.

CADE-1992-NipkowQ #reduction #type system #unification #λ-calculus

Reduction and Unification in Lambda Calculi with Subtypes (TN, ZQ), pp. 66–78.

JICSLP-1992-Cerrito #calculus #ll #unification

Herbrand Methods in Sequent Calculi: Unification in LL (SC), pp. 607–621.

LICS-1992-Geuvers #λ-calculus

The Church-Rosser Property for βη-reduction in Typed λ-Calculi (HG), pp. 453–460.

POPL-1991-HengleinM #complexity #higher-order #type inference #λ-calculus

The Complexity of Type Inference for Higher-Order Typed λ Calculi (FH, HGM), pp. 119–130.

POPL-1991-Maranget #orthogonal #term rewriting #λ-calculus

Optimal Derivations in Weak λ-calculi and in Orthogonal Terms Rewriting Systems (LM), pp. 255–269.

ESOP-1990-BarendregtH #programming language #λ-calculus

Types in λ Calculi and Programming Languages (HB, KH), pp. 1–35.

ICALP-1978-Berry #modelling #λ-calculus

Stable Models of Typed λ-Calculi (GB), pp. 72–89.