FSCD 2017 Contributors -

Filter

Role Type

Contributing to

Number of Roles

Country

Results (78)

A Benedikt AhrensAhrens, Benedikt Displayed categories
Yohji AkamaAkama, Yohji The confluent terminating context-free substitutive rewriting system for the λ-calculus with surjective pairing and terminal type
Takahito AotoAoto, Takahito Improving Rewriting Induction Approach for Proving Ground Confluence
Robert AtkeyAtkey, Robert University of Strathclyde Continuation Passing Style for Effect Handlers
B Patrick BahrBahr, Patrick IT University of CopenhagenDenmark Böhm Reduction in Infinitary Term Graph Rewriting Systems
Pablo BarenbaumBarenbaum, Pablo University of Buenos Aires, Argentina / IRIF, France / University of Paris Diderot, France Optimality and the Linear Substitution Calculus
Malgorzata BiernackaBiernacka, Malgorzata University of Wroclaw Generalized Refocusing: from Hybrid Strategies to Abstract Machines
Jasmin BlanchetteBlanchette, Jasmin Vrije Universiteit AmsterdamNetherlands Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL
Eduardo BonelliBonelli, Eduardo CONICET, Argentina / Universidad Nacional de Quilmes, Argentina Optimality and the Linear Substitution Calculus
C Simon CastellanCastellan, Simon Observably Deterministic Concurrent Strategies and Intensional Full Abstraction for Parallel-or
Witold CharatonikCharatonik, Witold Generalized Refocusing: from Hybrid Strategies to Abstract Machines
Pierre ClairambaultClairambault, Pierre Observably Deterministic Concurrent Strategies and Intensional Full Abstraction for Parallel-or
Robin CockettCockett, Robin There is only one notion of differentiation
Lukasz CzajkaCzajka, Lukasz University of Innsbruck Confluence of an extension of Combinatory Logic by Boolean constants
D Andrej DudenhefnerDudenhefner, Andrej Technical University Dortmund The Complexity of Principal Inhabitation
F Marcelo FioreFiore, Marcelo Computer Laboratory, University of Cambridge List Objects with Algebraic Structure
Mathias FleuryFleury, Mathias MPI-INFGermany Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL
Koichi FujimaFujima, Koichi Streett Automata Model Checking of Higher-Order Recursion Schemes
G Marco GaboardiGaboardi, Marco University at Buffalo, SUNY, USAUnited States Type systems for the relational verification of higher order programs
Jürgen GieslGiesl, Jürgen Termination and Complexity Competition 2017
Stefano GuerriniGuerrini, Stefano Is the optimal implementation inefficient? Elementarily not
H Daniel HillerströmHillerström, Daniel The University of EdinburghUnited Kingdom Continuation Passing Style for Effect Handlers
Nao HirokawaHirokawa, Nao JAIST Infinite Runs in Abstract Completion
Jan HoffmannHoffmann, Jan Carnegie Mellon UniversityUnited States Arrays and References in Resource Aware ML
I Benedetto IntrigilaIntrigila, Benedetto Refutation of Sallé's Longstanding Conjecture
K Jonas KaiserKaiser, Jonas Relating System F and λ2: A Case Study in Coq, Abella and Beluga
Max KanovichKanovich, Max A polynomial-time algorithm for the Lambek calculus with brackets of bounded order
Akitoshi KawamuraKawamura, Akitoshi Polynomial running times for polynomial-time oracle machines
Delia KesnerKesner, Delia IRIF, France / University of Paris Diderot, France Types as Resources for Classical Natural Deduction
Yuta KimuraKimura, Yuta Improving Rewriting Induction Approach for Proving Ground Confluence
Naoki KobayashiKobayashi, Naoki University of Tokyo, Japan Streett Automata Model Checking of Higher-Order Recursion Schemes
Stepan KuznetsovKuznetsov, Stepan A polynomial-time algorithm for the Lambek calculus with brackets of bounded order
L Peter Lefanu LumsdaineLefanu Lumsdaine, Peter Displayed categories
Jean-Simon LemayLemay, Jean-Simon There is only one notion of differentiation
Dan LicataLicata, Dan Wesleyan UniversityUnited States A Fibrational Framework for Substructural and Modal Logics
Benjamin LichtmanLichtman, Benjamin Arrays and References in Resource Aware ML
Sam LindleyLindley, Sam University of Edinburgh, UKUnited Kingdom Continuation Passing Style for Effect Handlers
Tadeusz LitakLitak, Tadeusz Negative Translations and Normal Modality
M Giulio ManzonettoManzonetto, Giulio Refutation of Sallé's Longstanding Conjecture
Aart MiddeldorpMiddeldorp, Aart Infinite Runs in Abstract Completion
Dale MillerMiller, Dale INRIA Saclay and LIXFrance Welcome message
Glyn MorrillMorrill, Glyn A polynomial-time algorithm for the Lambek calculus with brackets of bounded order
Georg MoserMoser, Georg University of Innsbruck Uniform Resource Analysis by Rewriting: Strenghts and Weaknesses
O Ian OrtonOrton, Ian Models of Type Theory Based on Moore Paths
P Brigitte PientkaPientka, Brigitte McGill University Relating System F and λ2: A Case Study in Coq, Abella and Beluga
Paolo PistonePistone, Paolo Dinaturality between syntax and semantics
Andrew PittsPitts, Andrew University of Cambridge Models of Type Theory Based on Moore Paths
Andrew PolonskyPolonsky, Andrew Refutation of Sallé's Longstanding Conjecture
Miriam PolzerPolzer, Miriam Negative Translations and Normal Modality
Pierre PradicPradic, Pierre A Curry-Howard Approach to Church’s Synthesis
R Ulrich RabensteinRabenstein, Ulrich Negative Translations and Normal Modality
Jakob RehofRehof, Jakob Technical University Dortmund The Complexity of Principal Inhabitation
Colin RibaRiba, Colin A Curry-Howard Approach to Church’s Synthesis
Mitchell RileyRiley, Mitchell A Fibrational Framework for Substructural and Modal Logics
Albert RubioRubio, Albert Termination and Complexity Competition 2017
S Philip SavilleSaville, Philip List Objects with Algebraic Structure
Andre ScedrovScedrov, Andre A polynomial-time algorithm for the Lambek calculus with brackets of bounded order
Michael ShulmanShulman, Michael A Fibrational Framework for Substructural and Modal Logics
Alexandra SilvaSilva, Alexandra University College LondonUnited Kingdom Brzozowski Goes Concurrent -- A Kleene Theorem for Pomset Languages
KC SivaramakrishnanSivaramakrishnan, KC University of CambridgeUnited Kingdom Continuation Passing Style for Effect Handlers
Gert SmolkaSmolka, Gert Saarland University Relating System F and λ2: A Case Study in Coq, Abella and Beluga
Marco SolieriSolieri, Marco University of BathUnited Kingdom Is the optimal implementation inefficient? Elementarily not
Sam StatonStaton, Sam University of Oxford Welcome message
Florian SteinbergSteinberg, Florian Polynomial running times for polynomial-time oracle machines
Christian SternagelSternagel, Christian Infinite Runs in Abstract Completion
Lutz StrassburgerStrassburger, Lutz Combinatorial Flows and their Normalisation
Ryota SuzukiSuzuki, Ryota Streett Automata Model Checking of Higher-Order Recursion Schemes
T Christine TassonTasson, Christine Quantitative semantics for probabilistic programming
Yoshihito ToyamaToyama, Yoshihito Improving Rewriting Induction Approach for Proving Ground Confluence
Dmitriy TraytelTraytel, Dmitriy ETH ZurichSwitzerland Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL
Takeshi TsukadaTsukada, Takeshi University of Tokyo, Japan Streett Automata Model Checking of Higher-Order Recursion Schemes
V Pierre VialVial, Pierre Types as Resources for Classical Natural Deduction
W Johannes WaldmannWaldmann, Johannes Termination and Complexity Competition 2017
Sarah WinklerWinkler, Sarah Infinite Runs in Abstract Completion
Glynn WinskelWinskel, Glynn Observably Deterministic Concurrent Strategies and Intensional Full Abstraction for Parallel-or
Y Akihisa YamadaYamada, Akihisa Termination and Complexity Competition 2017
Z Noam ZeilbergerZeilberger, Noam University of Birmingham, UK A sequent calculus for semi-associativity
Klara ZielińskaZielińska, Klara Generalized Refocusing: from Hybrid Strategies to Abstract Machines