Practical foundations for programming languages
From MaRDI portal
Recommendations
Cited in
(49)- Meaning explanations at higher dimension
- Polymorphic lambda calculus with context-free session types
- Types for complexity of parallel computation in pi-calculus
- On rational choice and the representation of decision problems
- Fairness and communication-based semantics for session-typed languages
- Structural focalization
- Supercompilation for Martin-Lof's type theory
- scientific article; zbMATH DE number 439891 (Why is no real title available?)
- scientific article; zbMATH DE number 7447752 (Why is no real title available?)
- Theories of Programming Languages
- scientific article; zbMATH DE number 555217 (Why is no real title available?)
- scientific article; zbMATH DE number 1531624 (Why is no real title available?)
- Computation semantics of the functional scientific workflow language Cuneiform
- scientific article; zbMATH DE number 756366 (Why is no real title available?)
- Higher order functions and Brouwer's thesis
- Proof-directed program transformation: a functional account of efficient regular expression matching
- Typed equivalence of effect handlers and delimited control
- Normalization by Evaluation for Typed Weak lambda-Reduction
- A general framework for static cost analysis of parallel logic programs
- scientific article; zbMATH DE number 7204440 (Why is no real title available?)
- Compiling with classical connectives
- scientific article; zbMATH DE number 7407781 (Why is no real title available?)
- Modularity in mathematics
- scientific article; zbMATH DE number 2238212 (Why is no real title available?)
- Two decades of automatic amortized resource analysis
- Programming language semantics: It’s easy as 1,2,3
- Classical (co)recursion: Mechanics
- Native type theory
- Polarized subtyping
- UNDER LOCK AND KEY: A PROOF SYSTEM FOR A MULTIMODAL LOGIC
- Interpreting knowledge-based programs
- A fibrational tale of operational logical relations: pure, effectful and differential
- Topological quantum gates in homotopy type theory
- Towards the complexity analysis of programming language proof methods
- A generic type system for higher-order -calculi
- Dependent type refinements for futures
- A denotationally-based program logic for higher-order store
- Adjoint natural deduction
- Second-order generalised algebraic theories: signatures and first-order semantics
- Kind inference for the \textsc{FreeST} programming language
- Call-by-value and call-by-name: a simple proof of a classic theorem
- Choice trees: representing and reasoning about nondeterministic, recursive, and impure programs in Rocq
- The quantum monadology
- Q\# as a quantum algorithmic language
- A contextual formalization of structural coinduction
- A logical approach to type soundness
- Paradoxical connectives: proof-theoretic semantics, recursion, and fixed-point operators
- Simply-typed constant-domain modal lambda calculus. I: Distanced beta reduction and combinatory logic
- Toward model-theoretic consistency verification in a dependently typed encoding of matching logic
This page was built for publication: Practical foundations for programming languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805272)
