Travelled to:
1 × Austria
1 × Denmark
1 × Finland
1 × Israel
11 × USA
Collaborated with:
∅ J.Raoult B.Prabhala D.B.MacQueen A.Tang A.V.Aho S.Lam S.A.Cook G.D.Plotkin P.J.Downey H.Samet J.L.Bruno E.G.C.Jr.
Talks about:
semant (4) languag (3) line (3) algorithm (2) schedul (2) program (2) express (2) storag (2) regist (2) compil (2)
Person: Ravi Sethi
DBLP: Sethi:Ravi
Facilitated 2 volumes:
Contributed to:
Wrote 17 papers:
- POPL-1984-MacQueenPS #polymorphism #recursion
- An Ideal Model for Recursive Polymorphic Types (DBM, GDP, RS), pp. 165–174.
- POPL-1984-RaoultS
- The Global Storage Needs of a Subcomputation (JCR, RS), pp. 148–157.
- ICALP-1982-RaoultS
- Properties of a Notation for Combining Functions (JCR, RS), pp. 429–441.
- LFP-1982-MacQueenS #semantics
- A Semantic Model of Types for Applicative Languages (DBM, RS), pp. 243–252.
- SCC-1982-Sethi #aspect-oriented #compilation #control flow #semantics
- Control Flow Aspects of Semantics Directed Compiling (RS), pp. 245–260.
- ICALP-1981-Sethi
- Circular Expressions: Elimination of Static Environments (RS), pp. 378–392.
- POPL-1980-Sethi #case study #programming language #semantics #specification
- A Case Study in Specifying the Semantics of a Programming Language (RS), pp. 117–130.
- ICALP-1979-SethiT #call-by #continuation #semantics
- Constructing Call-by-Value Continuation Semantics (RS, AT), pp. 556–570.
- POPL-1978-DowneySS #algorithm #online
- Off-Line and On-Line Algorithms for Deducing Equalities (PJD, HS, RS), pp. 158–170.
- POPL-1978-PrabhalaS #performance
- Efficient Computation of Expressions with Common Subexpressions (BP, RS), pp. 222–230.
- ICALP-1977-AhoS #code generation #compilation #how #question
- How Hard is Compiler Code Generation? (AVA, RS), pp. 1–15.
- STOC-1977-PrabhalaS #comparison #set #stack
- A Comparison of Instruction Sets for Stack Machines (BP, RS), pp. 132–142.
- SOSP-1975-LamS #algorithm #analysis #scheduling
- Analysis of a Level Algorithm for Preemptive Scheduling (SL, RS), pp. 178–186.
- STOC-1974-CookS #polynomial #requirements
- Storage Requirements for Deterministic Polynomial Time Recognizable Languages (SAC, RS), pp. 33–39.
- SOSP-1973-BrunoCS #independence #scheduling
- Scheduling Independent Tasks to Reduce Mean Finishing Time (JLB, EGCJ, RS), pp. 102–103.
- STOC-1973-Sethi #problem
- Complete Register Allocation Problems (RS), pp. 182–195.
- STOC-1972-Sethi #source code #validation
- Validating Register Allocations for Straight Line Programs (RS), pp. 222–237.