default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMorten Heine Sørensen
Person information
- affiliation: University of Copenhagen, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1997
[b1]Morten Heine Sørensen:
Normalization in λ-calculus and type theory. University of Copenhagen, Denmark, Technical report / University of Copenhagen / Datalogisk institut 97/27, 1997
Journal Articles
- 2019
- [j18]Morten Heine Sørensen:
Raymond Smullyan, A Beginner's Further Guide to Mathematical Logic - World Scientific Publishing 2017, pp. 288; ISBN-10: 9814725722 (hardback) £45.00, ISBN-13: 978-9814725729 (paperback) £24.00, (kindle) £13.49. Stud Logica 107(5): 1079-1081 (2019) - 2013
- [j17]Morten Heine Sørensen:
Book Reviews. Stud Logica 101(5): 1143-1145 (2013) - 2010
- [j16]Morten Heine Sørensen, Pawel Urzyczyn:
A Syntactic Embedding of Predicate Logic into Second-Order Propositional Logic. Notre Dame J. Formal Log. 51(4): 457-473 (2010) - 2008
- [j15]Morten Heine Sørensen, Pawel Urzyczyn:
Strong cut-elimination in sequent calculus using Klop's iota-translation and perpetual reductions. J. Symb. Log. 73(3): 919-932 (2008) - 2007
- [j14]Morten Heine Sørensen:
A Note on Shortest Developments. Log. Methods Comput. Sci. 3(4) (2007) - 2003
- [j13]Inge Li Gørtz, Signe Reuss, Morten Heine Sørensen:
Strong Normalization from Weak Normalization by Translation into the Lambda-I-Calculus. High. Order Symb. Comput. 16(3): 253-285 (2003) - 2002
- [j12]Peter Møller Neergaard, Morten Heine Sørensen:
Conservation and Uniform Normalization in Lambda Calculi with Erasing Reductions. Inf. Comput. 178(1): 149-179 (2002) - 2001
- [j11]Gilles Barthe
, John Hatcliff, Morten Heine Sørensen:
An induction principle for pure type systems. Theor. Comput. Sci. 266(1-2): 773-818 (2001) - [j10]Gilles Barthe, John Hatcliff, Morten Heine Sørensen:
Weak normalization implies strong normalization in a class of non-dependent pure type systems. Theor. Comput. Sci. 269(1-2): 317-361 (2001) - 2000
- [j9]Gilles Barthe, Morten Heine Sørensen:
Domain-free pure type systems. J. Funct. Program. 10(5): 417-452 (2000) - [j8]Danny De Schreye, Robert Glück, Jesper Jørgensen, Michael Leuschel, Bern Martens, Morten Heine Sørensen:
Erratum to: "Conjunctive Partial Deduction: Foundations, Control, Algorithms and Experiments". J. Log. Program. 43(3): 265 (2000) - [j7]Morten Heine Sørensen:
Convergence of program transformers in the metric space of trees. Sci. Comput. Program. 37(1-3): 163-205 (2000) - 1999
- [j6]Femke van Raamsdonk, Paula Severi, Morten Heine Sørensen, Hongwei Xi:
Perpetual Reductions in Lambda-Calculus. Inf. Comput. 149(2): 173-225 (1999) - [j5]Danny De Schreye, Robert Glück, Jesper Jørgensen, Michael Leuschel, Bern Martens, Morten Heine Sørensen:
Conjunctive Partial Deduction: Foundations, Control, Algorithms, and Experiments. J. Log. Program. 41(2-3): 231-277 (1999) - [j4]Gilles Barthe, John Hatcliff, Morten Heine Sørensen:
CPS Translations and Applications: The Cube and Beyond. High. Order Symb. Comput. 12(2): 125-170 (1999) - 1998
- [j3]Helmut Seidl, Morten Heine Sørensen:
Constraints to Stop Deforestation. Sci. Comput. Program. 32(1-3): 73-107 (1998) - 1997
- [j2]Morten Heine Sørensen:
Strong Normalization from Weak Normalization in Typed Lambda-Calculi. Inf. Comput. 133(1): 35-71 (1997) - 1996
- [j1]Morten Heine Sørensen, Robert Glück, Neil D. Jones:
A Positive Supercompiler. J. Funct. Program. 6(6): 811-838 (1996)
Conference and Workshop Papers
- 2014
- [c23]Geoff W. Hamilton, Morten Heine Sørensen:
Local Driving in Higher-Order Positive Supercompilation via the Omega-theorem. VPT@CAV 2014: 36-51 - 2013
- [c22]Morten Heine Sørensen:
Use case-driven performance engineering without "concurrent users". ICPE 2013: 3-12 - 2002
- [c21]Morten Heine Sørensen, Jens P. Secher:
From Type Inference to Configuration. The Essence of Computation 2002: 436-472 - [c20]Jens P. Secher, Morten Heine Sørensen:
From checking to inference via driving and dag grammars. PEPM 2002: 41-51 - 1999
- [c19]Jens P. Secher, Morten Heine Sørensen:
On Perfect Supercompilation. Ershov Memorial Conference 1999: 113-127 - [c18]Peter Harry Eidorff, Fritz Henglein, Christian Mossin, Henning Niss, Morten Heine Sørensen, Mads Tofte:
AnnoDomini: From Type Theory to Year 2000 Conversion Tool. POPL 1999: 1-14 - [c17]Peter Harry Eidorff, Fritz Henglein, Christian Mossin, Henning Niss, Morten Heine Sørensen, Mads Tofte:
AnnoDomini in Practice: A Type-Theoretic Approach to the Year 2000 Problem. TLCA 1999: 6-13 - 1998
- [c16]Morten Heine Sørensen:
Convergence of Program Transformers in the Metric Space of Trees. MPC 1998: 315-337 - [c15]Morten Heine Sørensen, Robert Glück:
Introduction to Supercompilation. Partial Evaluation 1998: 246-270 - 1997
- [c14]Gilles Barthe, Morten Heine Sørensen:
Domain-Free Pure Type Systems. LFCS 1997: 9-20 - [c13]Gilles Barthe, John Hatcliff, Morten Heine Sørensen:
Reflections on Reflections. PLILP 1997: 241-258 - [c12]Helmut Seidl, Morten Heine Sørensen:
Constraints to Stop Higher-Order Deforestation. POPL 1997: 400-413 - [c11]Gilles Barthe, John Hatcliff, Morten Heine Sørensen:
A notion of classical pure type system. MFPS 1997: 4-59 - 1996
- [c10]Morten Heine Sørensen:
Efficient Longest and Infinite Reduction Paths in Untyped Lambda-Calculi. CAAP 1996: 287-301 - [c9]Robert Glück, Morten Heine Sørensen:
A Roadmap to Metacomputation by Supercompilation. Dagstuhl Seminar on Partial Evaluation 1996: 137-160 - [c8]Michael Leuschel, Morten Heine Sørensen:
Redundant Argument Filtering of Logic Programs. LOPSTR 1996: 83-103 - [c7]Robert Glück, Jesper Jørgensen, Bern Martens, Morten Heine Sørensen:
Controlling Conjunctive Partial Deduction. PLILP 1996: 152-166 - 1995
- [c6]Kristian Nielsen, Morten Heine Sørensen:
Call-By-Name CPS-Translation as a Binding-Time Improvement. SAS 1995: 296-313 - [c5]Morten Heine Sørensen, Robert Glück:
An Algorithm of Generalization in Positive Supercompilation. ILPS 1995: 465-479 - 1994
- [c4]Morten Heine Sørensen:
Grammar-Based Data-Flow Analysis to Stop Deforestation. CAAP 1994: 335-351 - [c3]Morten Heine Sørensen, Robert Glück, Neil D. Jones:
Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC. ESOP 1994: 485-500 - [c2]Robert Glück, Morten Heine Sørensen:
Partial Deduction and Driving are Equivalent. PLILP 1994: 165-181 - [c1]Jakob Rehof, Morten Heine Sørensen:
The LambdaDelta-calculus. TACS 1994: 516-542
Informal and Other Publications
- 2007
- [i1]Morten Heine Sørensen:
A Note on Shortest Developments. CoRR abs/0708.0200 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
