Pages that link to "Item:Q2709784"

The following pages link to Mathematical Structures in Computer Science (Q2709784):

Displaying 50 items.

• Prefix partitioned Gray codes for particular cross-bifix-free sets (Q458743) (← links)
• Domain equations for probabilistic processes (Q2709785) (← links)
• Linear types and approximation (Q2709786) (← links)
• Theory and applications of explicit substitutions: Introduction (Q2713350) (← links)
• Pure type systems with explicit substitution (Q2713351) (← links)
• HOL-λσ: an intentional first-order expression of higher-order logic (Q2713352) (← links)
• Perpetuality in a named lambda calculus with explicit substitutions (Q2713353) (← links)
• Dependent types and explicit substitutions: a meta-theoretical development (Q2713354) (← links)
• Cut rules and explicit substitutions (Q2713355) (← links)
• A λ-calculus with explicit weakening and explicit substitution (Q2713357) (← links)
• Implicit exchange in multiplicative proofnets (Q2719797) (← links)
• Mu-depth 3 is more than 2: a game-theoretic proof (Q2719798) (← links)
• Control categories and duality: on the categorical semantics of the lambda-mu calculus (Q2719799) (← links)
• Preface to Locus Solum (Q2732137) (← links)
• Locus Solum: From the rules of logic to the logic of rules (Q2732138) (← links)
• A judgmental reconstruction of modal logic (Q2746757) (← links)
• The Russell–Prawitz modality (Q2746758) (← links)
• Recursion over objects of functional type (Q2746760) (← links)
• Proof search in Lax Logic (Q2746761) (← links)
• Extracting information from intermediate semiconstructive HA-systems – extended abstract (Q2746762) (← links)
• Computation Algebras (Q2762624) (← links)
• Double-pushout graph transformation revisited (Q2762625) (← links)
• Categorical properties of logical frameworks (Q2785694) (← links)
• Chu I: cofree equivalences, dualities and *-autonomous categories (Q2785695) (← links)
• Intuitionistic model constructions and normalization proofs (Q2785696) (← links)
• Can we build it: formal synthesis of control strategies for cooperative driver assistance systems (Q2843860) (← links)
• Model checking for performability (Q2843861) (← links)
• A modular formal semantics for Ptolemy (Q2843863) (← links)
• Rigorous implementation of real-time systems – from theory to application (Q2843865) (← links)
• Characteristic formulae for fixed-point semantics: a general framework (Q2883115) (← links)
• Modal logic and the approximation induction principle (Q2883116) (← links)
• Almost linear Büchi automata (Q2883118) (← links)
• On projecting processes into session types (Q2883119) (← links)
• Proving the validity of equations in GSOS languages using rule-matching bisimilarity (Q2883120) (← links)
• A hierarchy of reverse bisimulations on stable configuration structures (Q2883121) (← links)
• The small-community phenomenon in networks (Q2888854) (← links)
• A coding theoretic study of MLL proof nets (Q2888855) (← links)
• What is a categorical model of the differential and the resource λ-calculi? (Q2888856) (← links)
• Spatial quantum search in a triangular network (Q2888857) (← links)
• Formalising PFSQL queries using ŁΠ fuzzy logic (Q2888858) (← links)
• On quasi-interpretations, blind abstractions and implicit complexity (Q2909730) (← links)
• Extending modal transition systems with structured labels (Q2909731) (← links)
• A quantum double construction in Rel (Q2909732) (← links)
• Static analysis of Biological Regulatory Networks dynamics using abstract interpretation (Q2909733) (← links)
• Extending relational algebra with similarities (Q2909734) (← links)
• A duality between exceptions and states (Q2909735) (← links)
• Introduction: computability of the physical (Q2919936) (← links)
• Renormalisation and computation II: time cut-off and the Halting Problem (Q2919937) (← links)
• A statistical mechanical interpretation of algorithmic information theory III: composite systems and fixed points (Q2919938) (← links)
• Algorithmic thermodynamics (Q2919939) (← links)