Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs (Q2331068): Difference between revisions

@@ Property / describes a project that uses @@
+F*
@@ Property / describes a project that uses: F* / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10817-019-09530-2
+Normal rank
@@ Property / OpenAlex ID @@
+W3165217919
@@ Property / OpenAlex ID: W3165217919 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q113901242
@@ Property / Wikidata QID: Q113901242 / rank @@
+Normal rank
@@ Property / cites work @@
+(Leftmost-Outermost) Beta Reduction is Invariant, Indeed
+Normal rank
@@ Property / cites work @@
+Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs
+Normal rank
@@ Property / cites work @@
+Light types for polynomial time computation in lambda calculus
+Normal rank
@@ Property / cites work @@
+Probabilistic relational verification for cryptographic implementations
+Normal rank
@@ Property / cites work @@
+Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy
+Normal rank
@@ Property / cites work @@
+Formal certification of code-based cryptographic proofs
+Normal rank
@@ Property / cites work @@
+Computer-Aided Security Proofs for the Working Cryptographer
+Normal rank
@@ Property / cites work @@
+The geometry of linear higher-order recursion
@@ Property / cites work: The geometry of linear higher-order recursion / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Dependent Types and Relative Completeness
@@ Property / cites work: Linear Dependent Types and Relative Completeness / rank @@
+Normal rank
@@ Property / cites work @@
+The geometry of types
@@ Property / cites work: The geometry of types / rank @@
+Normal rank
@@ Property / cites work @@
+Lightweight semiformal time complexity analysis for purely functional data structures
+Normal rank
@@ Property / cites work @@
+On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits
+Normal rank
@@ Property / cites work @@
+Cost recurrences for DML programs
@@ Property / cites work: Cost recurrences for DML programs / rank @@
+Normal rank
@@ Property / cites work @@
+SPEED
@@ Property / cites work: SPEED / rank @@
+Normal rank
@@ Property / cites work @@
+Amortized Resource Analysis with Polynomial Potential
+Normal rank
@@ Property / cites work @@
+Safe recursion with higher types and BCK-algebra
@@ Property / cites work: Safe recursion with higher types and BCK-algebra / rank @@
+Normal rank
@@ Property / cites work @@
+A flow calculus of             <i>mwp</i>             -bounds for complexity analysis
+Normal rank
@@ Property / cites work @@
+Q3142166
@@ Property / cites work: Q3142166 / rank @@
+Normal rank
@@ Property / cites work @@
+Secure distributed programming with value-dependent types
+Normal rank
@@ Property / cites work @@
+Dependent types for program termination verification
+Normal rank