Eijiro Sumii

Affiliations:
  • Tohoku University, ECEI


According to our database1, Eijiro Sumii authored at least 32 papers between 1998 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Formal Verifications of Call-by-Need and Call-by-Name Evaluations with Mutual Recursion.
Proceedings of the Programming Languages and Systems - 17th Asian Symposium, 2019

2018
Formal Verification of the Correspondence Between Call-by-Need and Call-by-Name.
Proceedings of the Functional and Logic Programming - 14th International Symposium, 2018

2016
Preface for special section from FLOPS 2014.
J. Funct. Program., 2016

A Sound and Complete Bisimulation for Contextual Equivalence in \lambda -Calculus with Call/cc.
Proceedings of the Programming Languages and Systems - 14th Asian Symposium, 2016

2015
Specialization of Generic Array Accesses After Inlining.
Proceedings of the Proceedings ML Family / OCaml Users and Developers workshops, 2015

2014
A Simple and Practical Linear Algebra Library Interface with Static Size Checking.
Proceedings of the Proceedings ML Family/OCaml Users and Developers workshops, 2014

2012
A Higher-Order Distributed Calculus with Name Creation.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

2011
Environmental bisimulations for higher-order languages.
ACM Trans. Program. Lang. Syst., 2011

From Applicative to Environmental Bisimulation.
Proceedings of the Twenty-seventh Conference on the Mathematical Foundations of Programming Semantics, 2011

Sound Bisimulations for Higher-Order Distributed Process Calculus.
Proceedings of the Foundations of Software Science and Computational Structures, 2011

2010
A bisimulation-like proof method for contextual properties in untyped lambda-calculus with references and deallocation.
Theor. Comput. Sci., 2010

Limitations of Applicative Bisimulation (Preliminary Report).
Proceedings of the Modelling, Controlling and Reasoning About State, 29.08. - 03.09.2010, 2010

2009
A Theory of Non-monotone Memory (Or: Contexts for free).
Proceedings of the Programming Languages and Systems, 2009

A Complete Characterization of Observational Equivalence in Polymorphic <i>lambda</i>-Calculus with General References.
Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

The Higher-Order, Call-by-Value Applied Pi-Calculus.
Proceedings of the Programming Languages and Systems, 7th Asian Symposium, 2009

2007
A bisimulation for dynamic sealing.
Theor. Comput. Sci., 2007

A bisimulation for type abstraction and recursion.
J. ACM, 2007

Logical Bisimulations and Functional Languages.
Proceedings of the International Symposium on Fundamentals of Software Engineering, 2007

2005
MinCaml: a simple and efficient compiler for a minimal functional language.
Proceedings of the 2005 workshop on Functional and Declarative Programming in Education, 2005

2003
The Extension of ML with Hypothetical Views for Discovery Science: Formalization and Implementation.
J. Funct. Log. Program., 2003

Logical Relations for Encryption.
J. Comput. Secur., 2003

The Interface Definition Language for Fail-Safe C.
Proceedings of the Software Security, 2003

2002
Regular Expression Types for Strings in a Text Processing Language.
Proceedings of the International Workshop in Types in Programming, 2002

Supporting objects in run-time bytecode specialization.
Proceedings of the ACM SIGPLAN ASIA-PEPM 2002, 2002

Fail-Safe ANSI-C Compiler: An Approach to Making C Programs Secure: Progress Report.
Proceedings of the Software Security -- Theories and Systems, 2002

VM lambda: A Functional Calculusfor Scientific Discovery.
Proceedings of the Functional and Logic Programming, 6th International Symposium, 2002

2001
A Hybrid Approach to Online and Offline Partial Evaluation.
High. Order Symb. Comput., 2001

A Typed Process Calculus for Fine-Grained Resource Access Control in Distributed Computation.
Proceedings of the Theoretical Aspects of Computer Software, 4th International Symposium, 2001

VM lambda: a Functional Calculus for Scientific Discovery.
Proceedings of the Second Asian Workshop on Programming Languages and Systems, 2001

2000
Online-and-Offline Partial Evaluation: A Mixed Approach (Extended Abstract).
Proceedings of the 2000 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '00), 2000

An Implicitly-Typed Deadlock-Free Process Calculus.
Proceedings of the CONCUR 2000, 2000

1998
A Generalized Deadlock-Free Process Calculus.
Proceedings of the 3rd International Workshop on High-Level Concurrent Languages, 1998


  Loading...