BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Belgium
1 × Cyprus
1 × Germany
1 × Hungary
1 × Ireland
1 × Latvia
1 × Sweden
1 × Switzerland
2 × Denmark
2 × Italy
2 × Poland
2 × The Netherlands
3 × United Kingdom
4 × Spain
5 × France
8 × USA
Collaborated with:
R.Sharp ∅ D.A.Orchard S.Thompson N.Johnson N.D.Jones T.Petricek A.R.Beresford R.Ennals R.Proust L.White R.Urma P.Calvert T.Schrijvers K.E.Gray S.Srinivasan B.Feigin K.L.Solberg M.Rosendahl C.Ernoult U.Goltz F.Nielson D.McDermott S.Dolan W.M.Khoo R.J.Anderson U.P.Khedker P.S.Rawat C.E.Oancea S.M.Watt J.J.Davies B.Rudiak-Gould S.L.P.Jones M.Goudarzi S.Hessabi D.J.Scott A.Ohori S.Katsumata T.P.0001 D.Syme R.Asati A.Sanyal A.Karkare
Talks about:
analysi (8) languag (6) type (6) base (6) use (6) program (5) function (4) hardwar (4) code (4) interpret (3)

Person: Alan Mycroft

DBLP DBLP: Mycroft:Alan

Facilitated 2 volumes:

CC 2006Ed
SAS 1995Ed

Contributed to:

CC 20142014
ICFP 20142014
Onward! 20142014
ICALP (2) 20132013
MSR 20132013
SAS 20132013
IFL 20122012
PLATEAU 20122012
SAS 20122012
SAS 20102010
FASE 20092009
ISMM 20092009
ECOOP 20082008
FASE 20082008
PEPM 20082008
SAS 20072007
ESOP 20062006
PEPM 20062006
CC 20052005
CC 20042004
DATE v2 20042004
ESOP 20042004
SAS 20042004
CC 20032003
FASE 20032003
SAS 20012001
TACAS 20012001
WCRE 20012001
ICALP 20002000
ESOP 19991999
PPDP 19951995
PEPM 19931993
WSA 19921992
ICALP 19911991
POPL 19861986
ICALP 19841984
SLP 19841984
ICALP 19831983
ESOP 20192019
Haskell 20112011
POPL 20172017

Wrote 42 papers:

CC-2014-AsatiSKM #garbage collection
Liveness-Based Garbage Collection (RA, AS, AK, AM), pp. 85–106.
ICFP-2014-PetricekOM #calculus #named
Coeffects: a calculus of context-dependent computation (TP, DAO, AM), pp. 123–135.
Onward-2014-ProustM #invariant
It’s Only Illegal If You Get Caught: Breaking Invariants and Getting Away with It (RP, AM), pp. 163–171.
ICALP-v2-2013-PetricekOM #named #static analysis
Coeffects: Unified Static Analysis of Context-Dependence (TP, DAO, AM), pp. 385–397.
MSR-2013-KhooMA #named
Rendezvous: a search engine for binary code (WMK, AM, RJA), pp. 329–338.
SAS-2013-WhiteM #algebra #analysis #memory management #optimisation #using
Concise Analysis Using Implication Algebras for Task-Local Memory Optimisation (LW, AM), pp. 433–453.
IFL-2012-OrchardM #monad
A Notation for Comonads (DAO, AM), pp. 1–17.
PLATEAU-2012-UrmaM #evolution #programming language #query #source code
Programming language evolution via source code query languages (RGU, AM), pp. 35–38.
SAS-2012-CalvertM #analysis #calculus #control flow
Control Flow Analysis for the Join Calculus (PC, AM), pp. 181–197.
SAS-2012-KhedkerMR #analysis #pointer
Liveness-Based Pointer Analysis (UPK, AM, PSR), pp. 265–282.
SAS-2010-SchrijversM #data flow #strict
Strictness Meets Data Flow (TS, AM), pp. 439–454.
FASE-2009-GrayM #logic #testing
Logical Testing (KEG, AM), pp. 186–200.
ISMM-2009-OanceaMW #algorithm #approach
A new approach to parallelising tracing algorithms (CEO, AM, SMW), pp. 10–19.
ECOOP-2008-SrinivasanM #java #named
Kilim: Isolation-Typed Actors for Java (SS, AM), pp. 104–128.
FASE-2008-DaviesBM #distributed #optimisation
Language-Based Optimisation of Sensor-Driven Distributed Computing Applications (JJD, ARB, AM), pp. 407–422.
PEPM-2008-FeiginM #hardware
Jones optimality and hardware virtualization: a report on work in progress (BF, AM), pp. 169–175.
SAS-2007-Mycroft #analysis #design #evolution #hardware #motivation #programming language
Programming Language Design and Analysis Motivated by Hardware Evolution (AM), pp. 18–33.
ESOP-2006-Rudiak-GouldMJ #haskell #ml
Haskell Is Not Not ML (BRG, AM, SLPJ), pp. 38–53.
PEPM-2006-ThompsonM #partial evaluation
Bit-level partial evaluation of synchronous circuits (ST, AM), pp. 29–37.
CC-2005-EnnalsSM #clustering #manycore #network
Task Partitioning for Multi-core Network Processors (RE, RS, AM), pp. 76–90.
CC-2004-JohnsonM #memory management #multi #using
Using Multiple Memory Access Instructions for Reducing Code Size (NJ, AM), pp. 265–280.
DATE-v2-2004-GoudarziHM #implementation #modelling #morphism #object-oriented #polymorphism
Overhead-Free Polymorphism in Network-on-Chip Implementation of Object-Oriented Models (MG, SH, AM), pp. 1380–1381.
ESOP-2004-EnnalsSM #linear
Linear Types for Packet Processing (RE, RS, AM), pp. 204–218.
SAS-2004-ThompsonM #abstract interpretation
Abstract Interpretation of Combinational Asynchronous Circuits (ST, AM), pp. 181–196.
CC-2003-JohnsonM #dependence #graph #using
Combined Code Motion and Register Allocation Using the Value State Dependence Graph (NJ, AM), pp. 1–16.
FASE-2003-ScottBM #mobile #policy #security
Spatial Security Policies for Mobile Agents in a Sentient Computing Environment (DJS, ARB, AM), pp. 102–117.
SAS-2001-SharpM #hardware #scheduling
Soft Scheduling for Hardware (RS, AM), pp. 57–72.
TACAS-2001-MycroftS #co-evolution #design #functional #hardware #using
Hardware/Software Co-Design Using Functional Languages (AM, RS), pp. 236–251.
WCRE-2001-MycroftOK #decompiler #type system
Comparing Type-Based and Proof-Directed Decompilation (AM, AO, SyK), pp. 362–367.
ICALP-2000-MycroftS #functional #parallel
A Statically Allocated Parallel Functional Language (AM, RS), pp. 37–48.
ESOP-1999-Mycroft #decompiler #re-engineering #type system
Type-Based Decompilation (or Program Reconstruction via Type Reconstruction) (AM), pp. 208–223.
PLILP-1995-MycroftS #analysis
Uniform PERs and Comportment Analysis (AM, KLS), pp. 169–187.
PEPM-1993-Mycroft #abstract interpretation
Completeness and predicate-based abstract interpretation (AM), pp. 179–185.
WSA-1992-MycroftR #graph
Minimal Function Graphs are not Instrumented (AM, MR), pp. 60–67.
ICALP-1991-ErnoultM #analysis #strict
Uniform Ideals and Strictness Analysis (CE, AM), pp. 47–59.
POPL-1986-JonesM #analysis #data flow #graph #source code #using
Data Flow Analysis of Applicative Programs Using Minimal Function Graphs (NDJ, AM), pp. 296–306.
ICALP-1984-GoltzM #on the #petri net
On the Relationship of CCS and Petri Nets (UG, AM), pp. 196–208.
SLP-1984-JonesM84 #development #prolog #semantics
Stepwise Development of Operational and Denotational Semantics for Prolog (NDJ, AM), pp. 281–288.
ICALP-1983-MycroftN #abstract interpretation #using
Strong Abstract Interpretation Using Power Domains (AM, FN), pp. 536–547.
ESOP-2019-McDermottM #call-by #evaluation #order #reasoning #source code
Extended Call-by-Push-Value: Reasoning About Effectful Programs and Evaluation Order (DM, AM), pp. 235–262.
Haskell-2011-PetricekMS #monad #pattern matching
Extending monads with pattern matching (TP0, AM, DS), pp. 1–12.
POPL-2017-DolanM #morphism #polymorphism #type inference #type system
Polymorphism, subtyping, and type inference in MLsub (SD, AM), pp. 60–72.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.