Travelled to:1 × France
1 × Germany
1 × Italy
1 × Spain
1 × Sweden
3 × USA
3 × United Kingdom
Collaborated with:R.Glück J.P.Secher H.Seidl M.Leuschel K.Nielsen P.H.Eidorff F.Henglein C.Mossin H.Niss M.Tofte G.Barthe J.Hatcliff N.D.Jones J.Jørgensen B.Martens
Talks about:partial (3) supercompil (2) deforest (2) reflect (2) domini (2) deduct (2) drive (2) year (2) type (2) anno (2)
Person: Morten Heine Sørensen
DBLP: S=oslash=rensen:Morten_Heine
Contributed to:
2002
1999
1999
19971997
19961996
1995
1995
19941994Wrote 11 papers:
- PEPM-2002-SecherS #graph
- From checking to inference via driving and dag grammars (JPS, MHS), pp. 41–51.
- POPL-1999-EidorffHMNST #named #type system
- AnnoDomini: From Type Theory to Year 2000 Conversion Tool (PHE, FH, CM, HN, MHS, MT), pp. 1–14.
- TLCA-1999-EidorffHMNST #approach #problem
- AnnoDomini in Practice: A Type-Theoretic Approach to the Year 2000 Problem (PHE, FH, CM, HN, MHS, MT), pp. 6–13.
- PLILP-1997-BartheHS
- Reflections on Reflections (GB, JH, MHS), pp. 241–258.
- POPL-1997-SeidlS #constraints #deforestation #higher-order
- Constraints to Stop Higher-Order Deforestation (HS, MHS), pp. 400–413.
- LOPSTR-1996-LeuschelS96a #logic programming #source code
- Redundant Argument Filtering of Logic Programs (ML, MHS), pp. 83–103.
- PLILP-1996-GluckJMS #deduction
- Controlling Conjunctive Partial Deduction (RG, JJ, BM, MHS), pp. 152–166.
- ILPS-1995-SorensenG #algorithm #supercompilation
- An Algorithm of Generalization in Positive Supercompilation (MHS, RG), pp. 465–479.
- SAS-1995-NielsenS #call-by
- Call-By-Name CPS-Translation as a Binding-Time Improvement (KN, MHS), pp. 296–313.
- ESOP-1994-SorensenGJ #deforestation #partial evaluation #supercompilation #towards
- Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC (MHS, RG, NDJ), pp. 485–500.
- PLILP-1994-GluckS #deduction
- Partial Deduction and Driving are Equivalent (RG, MHS), pp. 165–181.