Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Martin Avanzini
Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order
ACM SIGPLAN Notices
Computer Science
Related publications
Comprehending Finite Maps for Algorithmic Debugging of Higher-Order Functional Programs
Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Complexity of Existential Positive First-Order Logic
Journal of Logic and Computation
Arts
Humanities
Hardware
Architecture
Logic
Theoretical Computer Science
Software
On Complexity of Complete First-Order Theories
Mathematical Logic Quarterly
Logic
Harnessing First Order Termination Provers Using Higher Order Dependency Pairs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
HOL-λσ: An Intentional First-Order Expression of Higher-Order Logic
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
The Completeness of the First-Order Functional Calculus
Journal of Symbolic Logic
Philosophy
Logic
Recursive Programs as Definitions in First-Order Logic
SIAM Journal on Computing
Mathematics
Computer Science
Higher-Order Asymptotic Expansions of the Least-Squares Estimation Bias in First-Order Dynamic Regression Models
Computational Statistics and Data Analysis
Statistics
Probability
Applied Mathematics
Computational Theory
Computational Mathematics
Mathematics
