Andrea Schalk

Computer Science · Physical Sciences

7h-index220citations19works0.02yr avg
OpenAlex↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Logic, programming, and type systems(15), Logic, Reasoning, and Knowledge(10), Formal Methods in Verification(5), semigroups and automata theory(4), Advanced Algebra and Logic(4)

Publications19 total

Modelling Multiplicative Linear Logic via Deep Inference
arXiv (Cornell University)·2024Open Access
A Category Theoretic Interpretation of Gandy's Principles for Mechanisms
arXiv (Cornell University)·2019Open Access
Constructing Fully Complete Models of Multiplicative Linear Logic
Logical Methods in Computer Science·2015· 2 citedOpen Access
Introduction to Game Semantics
Research Explorer (The University of Manchester)·2012
Constructing Fully Complete Models for Multiplicative Linear Logic
2012
10252 Executive Summary – Game Semantics and Program Verification
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2010Open Access
10252 Abstracts Collection – Game Semantics and Program Verification
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2010Open Access
Modelling Linear Logic Without Units (Preliminary Results)
arXiv (Cornell University)·2005· 10 citedOpen Access
Concrete Data Structures as Games
Electronic Notes in Theoretical Computer Science·2005· 6 citedOpen Access
Poset-valued sets or how to build models for linear logics
Theoretical Computer Science·2003· 7 cited
Games on graphs and sequentially realizable functionals. Extended abstract
2003· 19 cited
Glueing and orthogonality for models of linear logic
Theoretical Computer Science·2003· 131 cited
A fully abstract denotational model for observational precongruence
Theoretical Computer Science·2001· 2 cited
Games for Semantics An Introduction DRAFT
2001
Abstract Games for Linear Logic Extended Abstract
Electronic Notes in Theoretical Computer Science·1999· 23 citedOpen Access
Building Models of Linear Logic
Lecture notes in computer science·1998· 1 cited
A fully abstract denotational model for observational precongruence
Lecture notes in computer science·1996
A Fully Abstract Denotational Model for Observational Congruence
BRICS Report Series·1995· 12 citedOpen Access
Domains arising as algebras for powerspace constructions
Journal of Pure and Applied Algebra·1993· 7 cited

Frequent Co-authors

Martin Hyland(3), Anna Ingólfsdóttir(3), Valeria de Paiva(2), Hugh Paul Steele(2), Paul-André Melliès(2), Andrzej S. Murawski(2), Igor Walukiewicz(2), Robin Houston(1), Dominic J. D. Hughes(1), José Juan Palacios-Perez(1), Joseph Razavi(1), Tomer Galor(1)