Travelled to:6 × USA
Collaborated with:N.D.Jones P.B.Gibbons U.F.Pleban R.L.Constable
Talks about:program (5) structur (2) problem (2) languag (2) equival (2) analysi (2) optim (2) lisp (2) flow (2) data (2)
Person: Steven S. Muchnick
DBLP: Muchnick:Steven_S=
Contributed to:
1986
1982
19821980197919761975
1972Wrote 8 papers:
- Best-of-PLDI-1986-MuchnickG #architecture #performance #pipes and filters #scheduling
- Efficient instruction scheduling for a pipelined architecture (with retrospective) (SSM, PBG), pp. 167–174.
- LFP-1982-MuchnickJ #combinator #evaluation
- A Fixed-Program Machine for Combinator Expression Evaluation (SSM, NDJ), pp. 11–20.
- POPL-1982-JonesM #analysis #approach #data flow #data type #flexibility #interprocedural #recursion #source code
- A Flexible Approach to Interprocedural Data Flow Analysis and Programs with Recursive Data Structures (NDJ, SSM), pp. 66–74.
- LISP-1980-MuchnickP #comparison #lisp #semantics
- A Semantic Comparison of LISP and Scheme (SSM, UFP), pp. 56–64.
- POPL-1979-JonesM #analysis #optimisation
- Flow Analysis and Optimization of Lisp-Like Structures (NDJ, SSM), pp. 244–256.
- POPL-1976-JonesM #design #optimisation #programming language #towards
- Binding Time Optimization in Programming Languages: Some Thoughts Toward the Design of an Ideal Language (NDJ, SSM), pp. 77–94.
- POPL-1975-JonesM #source code
- Even Simple Programs are Hard to Analyze (NDJ, SSM), pp. 106–118.
- STOC-1972-ConstableM #decidability #equivalence #problem #recursion
- Subrecursive Program Schemata I & II: I. Undecidable Equivalence Problems; II. Decidable Equivalence Problems (RLC, SSM), pp. 1–17.