The following pages link to Elaine Pimentel (Q281159):
Displaying 44 items.
- Dynamic spaces in concurrent constraint programming (Q281160) (← links)
- Proving concurrent constraint programming correct, revisited (Q530860) (← links)
- Strong normalization from an unusual point of view (Q534700) (← links)
- Subexponential concurrent constraint programming (Q897936) (← links)
- Multi-focused proofs with different polarity assignments (Q1744415) (← links)
- From cut-free calculi to automated deduction: the case of bounded contraction (Q1744444) (← links)
- Hybrid and subexponential linear logics (Q1744445) (← links)
- A semantical view of proof systems (Q1799270) (← links)
- A formal framework for specifying sequent calculus proof systems (Q1944778) (← links)
- Ecumenical modal logic (Q2055765) (← links)
- A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems (Q2095424) (← links)
- Non-associative, non-commutative multi-modal linear logic (Q2104536) (← links)
- From axioms to synthetic inference rules via focusing (Q2120974) (← links)
- A pure view of ecumenical modalities (Q2148808) (← links)
- Countermodel construction via optimal hypersequent calculi for non-normal modal logics (Q2177577) (← links)
- Sequentialising nested systems (Q2180514) (← links)
- A game model for proofs with costs (Q2180520) (← links)
- A fresh view of linear logic as a logical framework (Q2229156) (← links)
- On concurrent behaviors and focusing in linear logic (Q2358701) (← links)
- On subexponentials, focusing and modalities in concurrent systems (Q2404074) (← links)
- A General Proof System for Modalities in Concurrent Constraint Programming (Q2842123) (← links)
- Lazy strong normalization (Q2851088) (← links)
- A Proof Theoretic Study of Soft Concurrent Constraint Programming (Q2931271) (← links)
- Proof Search in Nested Sequent Calculi (Q3460084) (← links)
- (Q4412848) (← links)
- Modularisation of Sequent Calculi for Normal and Non-normal Modalities (Q4633639) (← links)
- A concurrent constraint programming interpretation of access permissions (Q4644356) (← links)
- A uniform framework for substructural logics with modalities (Q4645752) (← links)
- (Q4664255) (← links)
- Intersection Types from a Proof-theoretic Perspective (Q4903721) (← links)
- (Q5018490) (← links)
- Hypersequent calculi for non-normal modal and deontic logics: countermodels and optimal complexity (Q5028311) (← links)
- Specifying Proof Systems in Linear Logic with Subexponentials (Q5179015) (← links)
- Hybrid linear logic, revisited (Q5236552) (← links)
- On the Specification of Sequent Systems (Q5387850) (← links)
- An extended framework for specifying and reasoning about proof systems (Q5739974) (← links)
- A linear logic framework for multimodal logics (Q5889307) (← links)
- Foundations of Software Science and Computation Structures (Q5899100) (← links)
- An ecumenical notion of entailment (Q6067097) (← links)
- (Q6159917) (← links)
- Explorations in Subexponential Non-associative Non-commutative Linear Logic (Q6196498) (← links)
- Ecumenical modal logic (Q6341654) (← links)
- A Rewriting Logic Approach to Specification, Proof-search, and Meta-proofs in Sequent Systems (Q6357858) (← links)
- A tour on ecumenical systems (invited talk) (Q6643048) (← links)
